Japan stirlingses Reservation Number 📞8

SearchAdvancedHelp

(0.002 seconds)

21—30 of 354 matching pages

21: 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$
…

►

…

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.9 Inequalities

§24.9 Inequalities

… ►

24.9.1 $$|B_{2n}|>|B_{2n}\left(x\right)|,$$ $1>x>0$,

ⓘ

Symbols:

$B_n$: Bernoulli numbers, $B_n\left(x\right)$: Bernoulli polynomials, $n$: integer and $x$: real or complex

A&S Ref:

23.1.13

Referenced by:

§24.9

Permalink:

http://dlmf.nist.gov/24.9.E1

Encodings:

pMML, png, TeX

See also:

Annotations for §24.9 and Ch.24

►

24.9.2 $$(2-2^{1-2n})|B_{2n}|\ge |B_{2n}\left(x\right)-B_{2n}|,$$ $1\ge x\ge 0$.

ⓘ

Symbols:

$B_n$: Bernoulli numbers, $B_n\left(x\right)$: Bernoulli polynomials, $n$: integer and $x$: real or complex

Referenced by:

§24.9

Permalink:

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

Encodings:

pMML, png, TeX

See also:

Annotations for §24.9 and Ch.24

… ►

24.9.3 $$4^{-n}|E_{2n}|>{(-1)}^n{E}_{2n}\left(x\right)>0,$$

ⓘ

Symbols:

$E_n$: Euler numbers, $E_n\left(x\right)$: Euler polynomials, $n$: integer and $x$: real or complex

A&S Ref:

23.1.13

Referenced by:

§24.9, §24.9

Permalink:

http://dlmf.nist.gov/24.9.E3

Encodings:

pMML, png, TeX

See also:

Annotations for §24.9 and Ch.24

… ►

24.9.7 $$8\sqrt{\frac{n}{\pi }}{\left(\frac{4n}{\pi \mathrm{e}}\right)}^{2n}\left(1+\frac{1}{12n}\right)>{(-1)}^n{E}_{2n}>8\sqrt{\frac{n}{\pi }}{\left(\frac{4n}{\pi \mathrm{e}}\right)}^{2n}.$$

ⓘ

Symbols:

$E_n$: Euler numbers, $\pi$: the ratio of the circumference of a circle to its diameter, $\mathrm{e}$: base of natural logarithm and $n$: integer

Referenced by:

§24.9, §24.9

Permalink:

http://dlmf.nist.gov/24.9.E7

Encodings:

pMML, png, TeX

See also:

Annotations for §24.9 and Ch.24

…

24: 24.11 Asymptotic Approximations

§24.11 Asymptotic Approximations

… ►

24.11.1 $${(-1)}^{n+1}{B}_{2n}\sim \frac{2(2n)!}{{(2\pi )}^{2n}},$$

ⓘ

Symbols:

$B_n$: Bernoulli numbers, $\sim$: asymptotic equality, $\pi$: the ratio of the circumference of a circle to its diameter, $!$: factorial (as in $n!$) and $n$: integer

Referenced by:

§24.11

Permalink:

http://dlmf.nist.gov/24.11.E1

Encodings:

pMML, png, TeX

See also:

Annotations for §24.11 and Ch.24

►

24.11.2 $${(-1)}^{n+1}{B}_{2n}\sim 4\sqrt{\pi n}{\left(\frac{n}{\pi \mathrm{e}}\right)}^{2n},$$

ⓘ

Symbols:

$B_n$: Bernoulli 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

Permalink:

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

Encodings:

pMML, png, TeX

See also:

Annotations for §24.11 and Ch.24

►

24.11.3 $${(-1)}^n{E}_{2n}\sim \frac{2^{2n+2}(2n)!}{{\pi }^{2n+1}},$$

ⓘ

Symbols:

$E_n$: Euler numbers, $\sim$: asymptotic equality, $\pi$: the ratio of the circumference of a circle to its diameter, $!$: factorial (as in $n!$) and $n$: integer

Permalink:

http://dlmf.nist.gov/24.11.E3

Encodings:

pMML, png, TeX

See also:

Annotations for §24.11 and Ch.24

►

24.11.4 $${(-1)}^n{E}_{2n}\sim 8\sqrt{\frac{n}{\pi }}{\left(\frac{4n}{\pi \mathrm{e}}\right)}^{2n}.$$

ⓘ

Symbols:

$E_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

…

25: 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$. …

26: 26.16 Multiset Permutations

… ►Let $S=\{1^{a_1},2^{a_2},\mathrm{\dots },n^{a_n}\}$ be the multiset that has $a_j$ copies of $j$, $1\le j\le n$. …The number of elements in ${𝔖}_S$ is the multinomial coefficient (§26.4) $\left(\genfrac{}{}{0.0pt}{}{a_1+a_2+\mathrm{\cdots }+a_n}{a_1,a_2,\mathrm{\dots },a_n}\right)$. … ►The definitions of inversion number and major index can be extended to permutations of a multiset such as $351322453154\in {𝔖}_{\{1^2,2^2,3^3,4^2,5^3\}}$. Thus $inv(351322453154)=4+8+0+3+1+1+2+3+1+0+1=24$, and $maj(351322453154)=2+4+8+9+11=34.$ … ►

26.16.1 $${\left[\genfrac{}{}{0.0pt}{}{a_1+a_2+\mathrm{\cdots }+a_n}{a_1,a_2,\mathrm{\dots },a_n}\right]}_q=\prod _{k=1}^{n-1}{\left[\genfrac{}{}{0.0pt}{}{a_k+a_{k+1}+\mathrm{\cdots }+a_n}{a_k}\right]}_q,$$

ⓘ

Symbols:

${\left[\genfrac{}{}{0.0pt}{}{n}{m}\right]}_q$: $q$-binomial coefficient (or Gaussian polynomial), ${\left[\genfrac{}{}{0.0pt}{}{a_1+a_2+\mathrm{\cdots }+a_n}{a_1,a_2,\mathrm{\dots },a_n}\right]}_q$: $q$-multinomial coefficient, $k$: nonnegative integer, $n$: nonnegative integer, $a_j$: numbers and $q$: parameter

Permalink:

http://dlmf.nist.gov/26.16.E1

Encodings:

pMML, png, TeX

See also:

Annotations for §26.16 and Ch.26

…

27: 26.3 Lattice Paths: Binomial Coefficients

… ► $\left(\genfrac{}{}{0.0pt}{}{m}{n}\right)$ is the number of ways of choosing $n$ objects from a collection of $m$ distinct objects without regard to order. $\left(\genfrac{}{}{0.0pt}{}{m+n}{n}\right)$ is the number of lattice paths from $(0,0)$ to $(m,n)$. …The number of lattice paths from $(0,0)$ to $(m,n)$, $m\le n$, that stay on or above the line $y=x$ is $\left(\genfrac{}{}{0.0pt}{}{m+n}{m}\right)-\left(\genfrac{}{}{0.0pt}{}{m+n}{m-1}\right).$ … ►

Table 26.3.1: Binomial coefficients $\left(\genfrac{}{}{0.0pt}{}{m}{n}\right)$.

► ►►►

$m$	$n$
	…
8	1	8	28	56	70	56	28	8	1
…

►

►

Table 26.3.2: Binomial coefficients $\left(\genfrac{}{}{0.0pt}{}{m+n}{m}\right)$ for lattice paths.

► ►►►

$m$	$n$
	0	1	2	3	4	5	6	7	8
…

►

…

28: 8 Incomplete Gamma and Related
Functions

Chapter 8 Incomplete Gamma and Related Functions

…

29: Errata

… ►This release increments the minor version number and contains considerable additions of new material and clarifications. … ►These additions were facilitated by an extension of the scheme for reference numbers; with “_” introducing intermediate numbers. … ►

Version 1.0.11 (June 8, 2016)

… ►

Originally the Stirling number $s(10,6)$ was given incorrectly as 6327. The correct number is 63273.

$n$	$k$
	$0$	$1$	$2$	$3$	$4$	$5$	$6$	$7$	$8$	$9$	$10$
10	$0$	$-\mathrm{3\hspace{0.17em}62880}$	$\mathrm{10\hspace{0.17em}26576}$	$-\mathrm{11\hspace{0.17em}72700}$	$\mathrm{7\hspace{0.17em}23680}$	$-\mathrm{2\hspace{0.17em}69325}$	$63273$	$-9450$	$870$	$-45$	$1$

Reported 2013-11-25 by Svante Janson.

… ►

Several new equations have been added. See (8.17.24), (20.7.34), §20.11(v), (26.12.27), (36.2.28), and (36.2.29).

…

30: 26.10 Integer Partitions: Other Restrictions

… ► $p(𝒟,n)$ denotes the number of partitions of $n$ into distinct parts. $p_m(𝒟,n)$ denotes the number of partitions of $n$ into at most $m$ distinct parts. $p(𝒟k,n)$ denotes the number of partitions of $n$ into parts with difference at least $k$. …$p(𝒪,n)$ denotes the number of partitions of $n$ into odd parts. $p(\in S,n)$ denotes the number of partitions of $n$ into parts taken from the set $S$. …