Schr%C3%B6der%20numbers

SearchAdvancedHelp

Did you mean Schr%C3%order%20numbers ?

(0.003 seconds)

1—10 of 275 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: 18.42 Software

… ►For another listing of Web-accessible software for the functions in this chapter, see GAMS (class C3). …

3: Bibliography S

… ►

Transformations of the Jacobian amplitude function and its calculation via the arithmetic-geometric mean. SIAM J. Math. Anal. 20 (6), pp. 1514–1528.

ⓘ

External Links:

ISSN 0036-1410, Document, MathReview (J. M. H. Peters), ZentralBlatt

Referenced by:

§22.19(i), §22.20(vi).

Encodings:

BibTeX

… ►

Uniform asymptotic forms of modified Mathieu functions. Quart. J. Mech. Appl. Math. 20 (3), pp. 365–380.

ⓘ

External Links:

Document, MathReview (F. W. J. Olver), ZentralBlatt

Referenced by:

§28.8(iv).

Encodings:

BibTeX

… ►

Staudt and arithmetical properties of Bernoulli numbers. Historia Sci. (2) 5 (1), pp. 69–74.

ⓘ

External Links:

ISSN 0285-4821, MathReview (Peter M. Neumann), ZentralBlatt

Referenced by:

§24.10(ii).

Encodings:

BibTeX

… ►

A Maple package for symmetric functions. J. Symbolic Comput. 20 (5-6), pp. 755–768.

ⓘ

Notes:

For software see John Stembridge’s home page. The SF package contains Maple software for zonal, Jack, and Macdonald polynomials.

External Links:

Home Page, ISSN 0747-7171, Document, MathReview, ZentralBlatt

Referenced by:

3rd item.

Encodings:

BibTeX

… ►

Asymptotische Entwicklungen der Jacobischen Polynome. Schr. der König. Gelehr. Gesell. Naturwiss. Kl. 10, pp. 33–112.

ⓘ

External Links:

ZentralBlatt

Referenced by:

§18.15(ii).

Encodings:

BibTeX

…

4: 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

…

5: 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 $(modm)$, which is correct to 20 digits. …

6: 27.2 Functions

… ►where $p_1,p_2,\mathrm{\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

…

7: 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

…

8: 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. …

9: 26.14 Permutations: Order Notation

… ►As an example, $35247816$ is an element of ${𝔖}_8.$ The inversion number is the number of pairs of elements for which the larger element precedes the smaller: … ► ►The Eulerian number, denoted , is the number of permutations in ${𝔖}_n$ with exactly $k$ descents. …The Eulerian number is equal to the number of permutations in ${𝔖}_n$ with exactly $k$ excedances. … ►

§26.14(iii) Identities

…

10: 26.13 Permutations: Cycle Notation

… ►The Stirling cycle numbers of the first kind, denoted by $\left[\genfrac{}{}{0.0pt}{}{n}{k}\right]$, count the number of permutations of $\{1,2,\mathrm{\dots },n\}$ with exactly $k$ cycles. They are related to Stirling numbers of the first kind by …See §26.8 for generating functions, recurrence relations, identities, and asymptotic approximations. … ►The derangement number, $d(n)$, is the number of elements of ${𝔖}_n$ with no fixed points: … ►A permutation is even or odd according to the parity of the number of transpositions. …