Eulerian%20numbers

(0.003 seconds)

1—10 of 274 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: 26.14 Permutations: Order Notation

… ► ►The Eulerian number, denoted

\genfrac{<}{>}{0.0pt}{}{n}{k}

, is the number of permutations in

\mathfrak{S}_{n}

with exactly

k

descents. … ►

§26.14(ii) Generating Functions

… ►

§26.14(iii) Identities

… ►

§26.14(iv) Special Values

…

3: 26.1 Special Notation

… ► ►►►►►

$\genfrac{(}{)}{0.0pt}{}{m}{n}$	binomial coefficient.
…
$\genfrac{<}{>}{0.0pt}{}{m}{n}$	Eulerian number.
…
$B\left(n\right)$	Bell number.
$C\left(n\right)$	Catalan number.
…

… ►Other notations for

s\left(n,k\right)

, the Stirling numbers of the first kind, include

S_{n}^{(k)}

(Abramowitz and Stegun (1964, Chapter 24), Fort (1948)),

S_{n}^{k}

(Jordan (1939), Moser and Wyman (1958a)),

\genfrac{(}{)}{0.0pt}{}{n-1}{k-1}B_{n-k}^{(n)}

(Milne-Thomson (1933)),

(-1)^{n-k}S_{1}(n-1,n-k)

(Carlitz (1960), Gould (1960)),

(-1)^{n-k}\left[n\atop k\right]

(Knuth (1992), Graham et al. (1994), Rosen et al. (2000)). ►Other notations for

S\left(n,k\right)

, the Stirling numbers of the second kind, include

\mathscr{S}^{(k)}_{n}

(Fort (1948)),

\mathfrak{S}_{n}^{k}

(Jordan (1939)),

\sigma_{n}^{k}

(Moser and Wyman (1958b)),

\genfrac{(}{)}{0.0pt}{}{n}{k}B_{n-k}^{(-k)}

(Milne-Thomson (1933)),

S_{2}(k,n-k)

(Carlitz (1960), Gould (1960)),

\left\{n\atop k\right\}

(Knuth (1992), Graham et al. (1994), Rosen et al. (2000)), and also an unconventional symbol in Abramowitz and Stegun (1964, Chapter 24).

4: 24.4 Basic Properties

… ►

§24.4(iv) Finite Expansions

… ►

24.4.15

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

ⓘ

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
Permalink:: http://dlmf.nist.gov/24.4.E15
Encodings:: pMML, png, TeX
See also:: Annotations for §24.4(iv), §24.4 and Ch.24

►

24.4.16

E_{2n}=\frac{1}{2n+1}-\sum_{k=1}^{n}{2n\choose 2k-1}\frac{2^{2k}(2^{2k-1}-1)B_% {2k}}{k},

ⓘ

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
Permalink:: http://dlmf.nist.gov/24.4.E16
Encodings:: pMML, png, TeX
See also:: Annotations for §24.4(iv), §24.4 and Ch.24

… ►

§24.4(ix) Relations to Other Functions

►For the relation of Bernoulli numbers to the Riemann zeta function see §25.6, and to the Eulerian numbers see (26.14.11).

5: 26.5 Lattice Paths: Catalan Numbers

§26.5 Lattice Paths: Catalan Numbers

►

§26.5(i) Definitions

►

C\left(n\right)

is the Catalan number. … ►

§26.5(ii) Generating Function

… ►

§26.5(iii) Recurrence Relations

…

6: 27.15 Chinese Remainder Theorem

§27.15 Chinese Remainder Theorem

… ►This theorem is employed to increase efficiency in calculating with large numbers by making use of smaller numbers in most of the calculation. …Their product

m

has 20 digits, twice the number of digits in the data. …These numbers, in turn, are combined by the Chinese remainder theorem to obtain the final result

\pmod{m}

, which is correct to 20 digits. …

7: 27.2 Functions

… ►where

p_{1},p_{2},\dots,p_{\nu\left(n\right)}

are the distinct prime factors of

n

, each exponent

a_{r}

is positive, and

\nu\left(n\right)

is the number of distinct primes dividing

n

. …Euclid’s Elements (Euclid (1908, Book IX, Proposition 20)) gives an elegant proof that there are infinitely many primes. … ►(See Gauss (1863, Band II, pp. 437–477) and Legendre (1808, p. 394).) … ► … ►

§27.2(ii) Tables

…

8: 26.6 Other Lattice Path Numbers

§26.6 Other Lattice Path Numbers

… ►

Delannoy Number $D(m,n)$

… ►

Motzkin Number $M(n)$

… ►

Narayana Number $N(n,k)$

… ►

§26.6(iv) Identities

…

9: 24.20 Tables

§24.20 Tables

… ►Wagstaff (1978) gives complete prime factorizations of

N_{n}

and

E_{n}

for

n=20(2)60

and

n=8(2)42

, respectively. …

10: Bibliography C

… ►

L. Carlitz (1953) Some congruences for the Bernoulli numbers. Amer. J. Math. 75 (1), pp. 163–172.

ⓘ

External Links:: FullText, MathReview (A. L. Whiteman), ZentralBlatt
Referenced by:: §24.10(i).
Encodings:: BibTeX

►

L. Carlitz (1954a)

q

-Bernoulli and Eulerian numbers. Trans. Amer. Math. Soc. 76 (2), pp. 332–350.

ⓘ

External Links:: FullText, MathReview (A. L. Whiteman), ZentralBlatt
Referenced by:: §17.3(iii), §24.16(iii).
Encodings:: BibTeX

… ►

R. Chelluri, L. B. Richmond, and N. M. Temme (2000) Asymptotic estimates for generalized Stirling numbers. Analysis (Munich) 20 (1), pp. 1–13.

ⓘ

External Links:: ISSN 0174-4747, MathReview (F. T. Howard), ZentralBlatt
Referenced by:: §26.8(vii).
Encodings:: BibTeX

… ►

M. Colman, A. Cuyt, and J. Van Deun (2011) Validated computation of certain hypergeometric functions. ACM Trans. Math. Software 38 (2), pp. Art. 11, 20.

ⓘ

External Links:: ISSN 0098-3500, Document, FullText, MathReview Entry, ZentralBlatt
Referenced by:: §13.29(v), §15.19(v).
Encodings:: BibTeX

… ►

M. D. Cooper, R. H. Jeppesen, and M. B. Johnson (1979) Coulomb effects in the Klein-Gordon equation for pions. Phys. Rev. C 20 (2), pp. 696–704.

ⓘ

External Links:: Document
Referenced by:: 5th item.
Encodings:: BibTeX

…