Japan Airlines Reservation Number %F0%9F%93%9E850.308.3021%F0%9F%93%9E

SearchAdvancedHelp

(0.006 seconds)

21—30 of 512 matching pages

21: 24.14 Sums

§24.14 Sums

►

§24.14(i) Quadratic Recurrence Relations

… ►

24.14.6 $$\sum _{k=0}^n\left(\genfrac{}{}{0pt}{}{n}{k}\right)2^k{B}_k{E}_{n-k}=2(1-2^{n-1})B_n-n{E}_{n-1}.$$

ⓘ

Symbols:

$B_n$: Bernoulli numbers, $E_n$: Euler numbers, $\left(\genfrac{}{}{0.0pt}{}{m}{n}\right)$: 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).

22: 27.9 Quadratic Characters

§27.9 Quadratic Characters

►For an odd prime $p$, the Legendre symbol $(n|p)$ is defined as follows. … ►

27.9.2 $$(2|p)={(-1)}^{(p^2-1)/8}.$$

ⓘ

Symbols:

$(n|p)$: Legendre symbol and $p$: odd prime

Referenced by:

§27.9

Permalink:

http://dlmf.nist.gov/27.9.E2

Encodings:

pMML, png, TeX

See also:

Annotations for §27.9 and Ch.27

►If $p,q$ are distinct odd primes, then the quadratic reciprocity law states that … ►If an odd integer $P$ has prime factorization $P={\prod }_{r=1}^{\nu \left(n\right)}{p}_r^{a_r}$, then the Jacobi symbol $(n|P)$ is defined by $(n|P)={\prod }_{r=1}^{\nu \left(n\right)}{(n|p_r)}^{a_r}$, with $(n|1)=1$. …

23: 24.5 Recurrence Relations

§24.5 Recurrence Relations

… ►

24.5.4 $$\sum _{k=0}^n\left(\genfrac{}{}{0pt}{}{2n}{2k}\right)E_{2k}=0,$$ $n=1,2,\mathrm{\dots }$,

ⓘ

Symbols:

$E_n$: Euler numbers, $\left(\genfrac{}{}{0.0pt}{}{m}{n}\right)$: binomial coefficient, $k$: integer and $n$: integer

Referenced by:

§24.19(i)

Permalink:

http://dlmf.nist.gov/24.5.E4

Encodings:

pMML, png, TeX

See also:

Annotations for §24.5(i), §24.5 and Ch.24

►

24.5.5 $$\sum _{k=0}^n\left(\genfrac{}{}{0pt}{}{n}{k}\right)2^k{E}_{n-k}+E_n=2.$$

ⓘ

Symbols:

$E_n$: Euler numbers, $\left(\genfrac{}{}{0.0pt}{}{m}{n}\right)$: binomial coefficient, $k$: integer and $n$: integer

Permalink:

http://dlmf.nist.gov/24.5.E5

Encodings:

pMML, png, TeX

See also:

Annotations for §24.5(i), §24.5 and Ch.24

►

§24.5(ii) Other Identities

… ►

§24.5(iii) Inversion Formulas

…

24: Bibliography

… ►

Congruences of $p$-adic integer order Bernoulli numbers. J. Number Theory 59 (2), pp. 374–388.

ⓘ

External Links:

ISSN 0022-314X, Document, MathReview (L. Skula), ZentralBlatt

Referenced by:

§24.16(iii).

Encodings:

BibTeX

… ►

Sharp bounds for the Bernoulli numbers. Arch. Math. (Basel) 74 (3), pp. 207–211.

ⓘ

External Links:

ISSN 0003-889X, Document, MathReview (L. Skula), ZentralBlatt

Referenced by:

§24.9.

Encodings:

BibTeX

… ►

Number Theory. In The New Encyclopaedia Britannica, Vol. 25, pp. 14–37.

ⓘ

Referenced by:

§27.13(i), §27.15, §27.16, Ch.27.

Encodings:

BibTeX

… ►

A Centennial History of the Prime Number Theorem. In Number Theory, Trends Math., pp. 1–14.

ⓘ

External Links:

MathReview (Giovanni Coppola), ZentralBlatt

Referenced by:

(25.16.2), (25.16.4), §25.16(i), §25.16.

Encodings:

BibTeX

… ►

A primer on Bernoulli numbers and polynomials. Math. Mag. 81 (3), pp. 178–190.

ⓘ

External Links:

ISSN 0025-570X, MathReview Entry, ZentralBlatt

Referenced by:

§24.5(ii), Ch.24.

Encodings:

BibTeX

…

25: 24.2 Definitions and Generating Functions

§24.2 Definitions and Generating Functions

►

§24.2(i) Bernoulli Numbers and Polynomials

… ►

§24.2(ii) Euler Numbers and Polynomials

… ►

Table 24.2.1: Bernoulli and Euler numbers.

► ►►

$n$	$B_n$	$E_n$
…

►

… ►

Table 24.2.4: Euler numbers $E_n$.

► ►►

$n$	$E_n$
…

►

…

26: 24.6 Explicit Formulas

§24.6 Explicit Formulas

… ►

24.6.4 $$E_{2n}=\sum _{k=1}^n\frac{1}{2^{k-1}}\sum _{j=1}^k{(-1)}^j\left(\genfrac{}{}{0pt}{}{2k}{k-j}\right)j^{2n},$$

ⓘ

Symbols:

$E_n$: Euler numbers, $\left(\genfrac{}{}{0.0pt}{}{m}{n}\right)$: binomial coefficient, $j$: integer, $k$: integer and $n$: integer

Referenced by:

§24.6

Permalink:

http://dlmf.nist.gov/24.6.E4

Encodings:

pMML, png, TeX

See also:

Annotations for §24.6 and Ch.24

►

24.6.5 $$E_{2n}=\frac{1}{2^{n-1}}\sum _{k=0}^{n-1}{(-1)}^{n-k}{(n-k)}^{2n}\sum _{j=0}^k\left(\genfrac{}{}{0pt}{}{2n-2j}{k-j}\right)2^j,$$

ⓘ

Symbols:

$E_n$: Euler numbers, $\left(\genfrac{}{}{0.0pt}{}{m}{n}\right)$: binomial coefficient, $j$: integer, $k$: integer and $n$: integer

Referenced by:

§24.6

Permalink:

http://dlmf.nist.gov/24.6.E5

Encodings:

pMML, png, TeX

See also:

Annotations for §24.6 and Ch.24

… ►

24.6.10 $$E_n=\frac{1}{2^n}\sum _{k=1}^{n+1}\left(\genfrac{}{}{0pt}{}{n+1}{k}\right)\sum _{j=0}^{k-1}{(-1)}^j{(2j+1)}^n.$$

ⓘ

Symbols:

$E_n$: Euler numbers, $\left(\genfrac{}{}{0.0pt}{}{m}{n}\right)$: binomial coefficient, $j$: integer, $k$: integer and $n$: integer

Referenced by:

§24.6, §24.6

Permalink:

http://dlmf.nist.gov/24.6.E10

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\left(\genfrac{}{}{0pt}{}{k}{j}\right){(1+2j)}^{2n}.$$

ⓘ

Symbols:

$E_n$: Euler numbers, $\left(\genfrac{}{}{0.0pt}{}{m}{n}\right)$: 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

27: 27.5 Inversion Formulas

§27.5 Inversion Formulas

… ►Generating functions yield many relations connecting number-theoretic functions. … ►Special cases of Möbius inversion pairs are: … ►Other types of Möbius inversion formulas include: … ►

28: Bibliography T

… ►

New congruences for the Bernoulli numbers. Math. Comp. 48 (177), pp. 341–350.

ⓘ

External Links:

ISSN 0025-5718, FullText, MathReview (Wells Johnson), ZentralBlatt

Referenced by:

1st item.

Encodings:

BibTeX

… ►

Asymptotic estimates of Stirling numbers. Stud. Appl. Math. 89 (3), pp. 233–243.

ⓘ

External Links:

ISSN 0022-2526, FullText, MathReview (E. Rodney Canfield), ZentralBlatt

Referenced by:

§26.8(vii).

Encodings:

BibTeX

… ►

Explicit formulas for the Bernoulli and Euler polynomials and numbers. Abh. Math. Sem. Univ. Hamburg 61, pp. 175–180.

ⓘ

External Links:

ISSN 0025-5858, Document, MathReview (L. Skula), ZentralBlatt

Referenced by:

§24.4(v), §24.6.

Encodings:

BibTeX

… ►

On the theory of the Bernoulli polynomials and numbers. J. Math. Anal. Appl. 104 (2), pp. 309–350.

ⓘ

External Links:

ISSN 0022-247X, Document, MathReview (Louis Shapiro), ZentralBlatt

Referenced by:

§24.15(iii).

Encodings:

BibTeX

… ►

Theory of the Fresnel integral. USSR Comput. Math. and Math. Phys. 9 (4), pp. 271–279.

ⓘ

Notes:

Translation of the paper in Zh. Vychisl. Mat. Mat. Fiz., Vol. 9, No. 4, 938-944, 1969

External Links:

Document, ZentralBlatt

Referenced by:

§7.13(iv).

Encodings:

BibTeX

29: 24.21 Software

… ►

§24.21(ii) $B_n$, $B_n\left(x\right)$, $E_n$, and $E_n\left(x\right)$

…

30: 26.9 Integer Partitions: Restricted Number and Part Size

§26.9 Integer Partitions: Restricted Number and Part Size

… ► $p_k\left(n\right)$ denotes the number of partitions of $n$ into at most $k$ parts. See Table 26.9.1. … ►It follows that $p_k\left(n\right)$ also equals the number of partitions of $n$ into parts that are less than or equal to $k$. …