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

SearchAdvancedHelp

(0.007 seconds)

11—20 of 512 matching pages

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

12: Guide to Searching the DLMF

… ►

a textual word, a number, or a math symbol.

►

any double-quoted sequence of textual words and numbers.

… ►

adj, prec/n, and near/n, where n is any positive natural number.

… ► ►►►

$	stands for any number of alphanumeric characters
	(the more conventional * is reserved for the multiplication operator)
…

…

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

…

14: 16.7 Relations to Other Functions

… ►For $\mathit{3}j$, $\mathit{6}j$, $\mathit{9}j$ symbols see Chapter 34. Further representations of special functions in terms of ${}_p{}^{}F_q^{}$ functions are given in Luke (1969a, §§6.2–6.3), and an extensive list of ${}_{q+1}{}^{}F_q^{}$ functions with rational numbers as parameters is given in Krupnikov and Kölbig (1997).

15: 26.11 Integer Partitions: Compositions

… ► $c\left(n\right)$ denotes the number of compositions of $n$, and $c_m\left(n\right)$ is the number of compositions into exactly $m$ parts. $c(\in T,n)$ is the number of compositions of $n$ with no 1’s, where again $T=\{2,3,4,\mathrm{\dots }\}$. … ►The Fibonacci numbers are determined recursively by … ►

26.11.6 $$c(\in T,n)=F_{n-1},$$ $n\ge 1$.

ⓘ

Symbols:

$\in$: element of, $c(\mathrm{condition},n)$: restricted number of compositions of $n$ , $n$: nonnegative integer, $T$: set and $F_n$: Fibonacci numbers

Permalink:

http://dlmf.nist.gov/26.11.E6

Encodings:

pMML, png, TeX

See also:

Annotations for §26.11 and Ch.26

… ►Additional information on Fibonacci numbers can be found in Rosen et al. (2000, pp. 140–145).

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

…

17: 27.2 Functions

… ►

§27.2(i) Definitions

… ►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$. … ►(See Gauss (1863, Band II, pp. 437–477) and Legendre (1808, p. 394).) … ► … ►

§27.2(ii) Tables

…

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

…

19: 26.7 Set Partitions: Bell Numbers

§26.7 Set Partitions: Bell Numbers

►

§26.7(i) Definitions

… ►

§26.7(ii) Generating Function

… ►

§26.7(iii) Recurrence Relation

… ►

§26.7(iv) Asymptotic Approximation

…

20: 34.10 Zeros

… ►In a $\mathit{3}j$ symbol, if the three angular momenta $j_1,j_2,j_3$ do not satisfy the triangle conditions (34.2.1), or if the projective quantum numbers do not satisfy (34.2.3), then the $\mathit{3}j$ symbol is zero. …However, the $\mathit{3}j$ and $\mathit{6}j$ symbols may vanish for certain combinations of the angular momenta and projective quantum numbers even when the triangle conditions are fulfilled. Such zeros are called nontrivial zeros. ►For further information, including examples of nontrivial zeros and extensions to $\mathit{9}j$ symbols, see Srinivasa Rao and Rajeswari (1993, pp. 133–215, 294–295, 299–310).