Bernoulli and Euler numbers

(0.004 seconds)

1—10 of 51 matching pages

1: 24.1 Special Notation

… ►

Bernoulli Numbers and Polynomials

►The origin of the notation

B_{n}

B_{n}\left(x\right)

, is not clear. … ►

Euler Numbers and Polynomials

… ►Its coefficients were first studied in Euler (1755); they were called Euler numbers by Raabe in 1851. The notations

E_{n}

E_{n}\left(x\right)

, as defined in §24.2(ii), were used in Lucas (1891) and Nörlund (1924). …

2: 24.21 Software

… ►

§24.21(ii) $B_{n}$ , $B_{n}\left(x\right)$ , $E_{n}$ , and $E_{n}\left(x\right)$

…

3: 24.14 Sums

§24.14 Sums

… ►

24.14.4

\sum_{k=0}^{n}{n\choose k}E_{k}E_{n-k}=-2^{n+1}E_{n+1}\left(0\right)=-2^{n+2}(% 1-2^{n+2})\frac{B_{n+2}}{n+2}.

ⓘ

Symbols:: $B_{\NVar{n}}$ : Bernoulli numbers, $E_{\NVar{n}}$ : Euler numbers, $E_{\NVar{n}}\left(\NVar{x}\right)$ : Euler polynomials, $\genfrac{(}{)}{0.0pt}{}{\NVar{m}}{\NVar{n}}$ : binomial coefficient, $k$ : integer and $n$ : integer
Permalink:: http://dlmf.nist.gov/24.14.E4
Encodings:: pMML, png, TeX
See also:: Annotations for §24.14(i), §24.14 and Ch.24

… ►

24.14.6

\sum_{k=0}^{n}{n\choose k}2^{k}B_{k}E_{n-k}=2(1-2^{n-1})B_{n}-nE_{n-1}.

ⓘ

Symbols:: $B_{\NVar{n}}$ : Bernoulli numbers, $E_{\NVar{n}}$ : Euler numbers, $\genfrac{(}{)}{0.0pt}{}{\NVar{m}}{\NVar{n}}$ : binomial coefficient, $k$ : integer and $n$ : integer
Referenced by:: §24.14(i)
Permalink:: http://dlmf.nist.gov/24.14.E6
Encodings:: pMML, png, TeX
See also:: Annotations for §24.14(i), §24.14 and Ch.24

… ►

§24.14(ii) Higher-Order Recurrence Relations

… ►For other sums involving Bernoulli and Euler numbers and polynomials see Hansen (1975, pp. 331–347) and Prudnikov et al. (1990, pp. 383–386).

4: 24.6 Explicit Formulas

§24.6 Explicit Formulas

… ►

24.6.6

E_{2n}=\sum_{k=1}^{2n}\frac{(-1)^{k}}{2^{k-1}}{2n+1\choose k+1}\*\sum_{j=0}^{% \left\lfloor\tfrac{1}{2}k-\tfrac{1}{2}\right\rfloor}{k\choose j}(k-2j)^{2n}.

ⓘ

Symbols:: $E_{\NVar{n}}$ : Euler numbers, $\genfrac{(}{)}{0.0pt}{}{\NVar{m}}{\NVar{n}}$ : binomial coefficient, $\left\lfloor\NVar{x}\right\rfloor$ : floor of $x$ , $j$ : integer, $k$ : integer and $n$ : integer
Referenced by:: §24.6
Permalink:: http://dlmf.nist.gov/24.6.E6
Encodings:: pMML, png, TeX
See also:: Annotations for §24.6 and Ch.24

… ►

24.6.12

E_{2n}=\sum_{k=0}^{2n}\frac{1}{2^{k}}\sum_{j=0}^{k}(-1)^{j}{k\choose j}(1+2j)^% {2n}.

ⓘ

Symbols:: $E_{\NVar{n}}$ : Euler numbers, $\genfrac{(}{)}{0.0pt}{}{\NVar{m}}{\NVar{n}}$ : binomial coefficient, $j$ : integer, $k$ : integer and $n$ : integer
Referenced by:: §24.6, §24.6
Permalink:: http://dlmf.nist.gov/24.6.E12
Encodings:: pMML, png, TeX
See also:: Annotations for §24.6 and Ch.24

5: 24.10 Arithmetic Properties

§24.10 Arithmetic Properties

… ►

§24.10(ii) Kummer Congruences

… ►

§24.10(iv) Factors

…

6: 24.5 Recurrence Relations

§24.5 Recurrence Relations

… ►

§24.5(iii) Inversion Formulas

…

7: 24.20 Tables

§24.20 Tables

…

8: 24.2 Definitions and Generating Functions

… ►

Table 24.2.1: Bernoulli and Euler numbers.

► ►►

$n$	$B_{n}$	$E_{n}$
…

► …

9: 24.9 Inequalities

§24.9 Inequalities

…

10: 24.11 Asymptotic Approximations

§24.11 Asymptotic Approximations

… ►

24.11.4

(-1)^{n}E_{2n}\sim 8\sqrt{\frac{n}{\pi}}\left(\frac{4n}{\pi e}\right)^{2n}.

ⓘ

Symbols:: $E_{\NVar{n}}$ : Euler numbers, $\sim$ : asymptotic equality, $\pi$ : the ratio of the circumference of a circle to its diameter, $\mathrm{e}$ : base of natural logarithm and $n$ : integer
Referenced by:: §24.11
Permalink:: http://dlmf.nist.gov/24.11.E4
Encodings:: pMML, png, TeX
See also:: Annotations for §24.11 and Ch.24

…