Emirates stirlingses Reservation Number 83267

SearchAdvancedHelp

(0.003 seconds)

11—20 of 226 matching pages

11: 24.16 Generalizations

§24.16 Generalizations

… ►

Polynomials and Numbers of Integer Order

… ►

Bernoulli Numbers of the Second Kind

… ►

Degenerate Bernoulli Numbers

… ►Here $s(n,m)$ again denotes the Stirling number of the first kind. …

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: 1.2 Elementary Algebra

… ►The arithmetic mean of $n$ numbers $a_1,a_2,\mathrm{\dots },a_n$ is … ►The geometric mean $G$ and harmonic mean $H$ of $n$ positive numbers $a_1,a_2,\mathrm{\dots },a_n$ are given by … ►If $r$ is a nonzero real number, then the weighted mean $M(r)$ of $n$ nonnegative numbers $a_1,a_2,\mathrm{\dots },a_n$, and $n$ positive numbers $p_1,p_2,\mathrm{\dots },p_n$ with … ►The dot product notation $𝐮\cdot 𝐯$ is reserved for the physical three-dimensional vectors of (1.6.2). … ►The diagonal elements are not necessarily distinct, and the number of identical (degenerate) diagonal elements is the multiplicity of that specific eigenvalue. …

14: 27.18 Methods of Computation: Primes

§27.18 Methods of Computation: Primes

►An overview of methods for precise counting of the number of primes not exceeding an arbitrary integer $x$ is given in Crandall and Pomerance (2005, §3.7). …An analytic approach using a contour integral of the Riemann zeta function (§25.2(i)) is discussed in Borwein et al. (2000). … ►These algorithms are used for testing primality of Mersenne numbers, $2^n-1$, and Fermat numbers, $2^{2^n}+1$. …

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 }\}$. … ►

26.11.1 $$c\left(0\right)=c(\in T,0)=1.$$

ⓘ

Symbols:

$\in$: element of, $c\left(n\right)$: number of compositions of $n$ , $c(\mathrm{condition},n)$: restricted number of compositions of $n$ and $T$: set

Permalink:

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

Encodings:

pMML, png, TeX

See also:

Annotations for §26.11 and Ch.26

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

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

…

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

…

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: 24.19 Methods of Computation

… ►

§24.19(i) Bernoulli and Euler Numbers and Polynomials

►Equations (24.5.3) and (24.5.4) enable $B_n$ and $E_n$ to be computed by recurrence. …A similar method can be used for the Euler numbers based on (4.19.5). … ►

§24.19(ii) Values of $B_n$ Modulo $p$

… ►We list here three methods, arranged in increasing order of efficiency. …