Aeromexico Airlines Reservation Number %F0%9F%93%9E850.308.302

Did you mean erricolo stirlingses Reservation Number %F0%9F%93%9E850.308.302 ?

(0.004 seconds)

1—10 of 467 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: 34.6 Definition: $\mathit{9j}$ Symbol

§34.6 Definition: $\mathit{9j}$ Symbol

►The

\mathit{9j}

symbol may be defined either in terms of

\mathit{3j}

symbols or equivalently in terms of

\mathit{6j}

symbols: ►

34.6.1

\begin{Bmatrix}j_{11}&j_{12}&j_{13}\\ j_{21}&j_{22}&j_{23}\\ j_{31}&j_{32}&j_{33}\end{Bmatrix}=\sum_{\mbox{\scriptsize all }m_{rs}}\begin{% pmatrix}j_{11}&j_{12}&j_{13}\\ m_{11}&m_{12}&m_{13}\end{pmatrix}\begin{pmatrix}j_{21}&j_{22}&j_{23}\\ m_{21}&m_{22}&m_{23}\end{pmatrix}\begin{pmatrix}j_{31}&j_{32}&j_{33}\\ m_{31}&m_{32}&m_{33}\end{pmatrix}\*\begin{pmatrix}j_{11}&j_{21}&j_{31}\\ m_{11}&m_{21}&m_{31}\end{pmatrix}\begin{pmatrix}j_{12}&j_{22}&j_{32}\\ m_{12}&m_{22}&m_{32}\end{pmatrix}\begin{pmatrix}j_{13}&j_{23}&j_{33}\\ m_{13}&m_{23}&m_{33}\end{pmatrix},

ⓘ

Defines:: $\begin{Bmatrix}\NVar{j_{11}}&\NVar{j_{12}}&\NVar{j_{13}}\\ \NVar{j_{21}}&\NVar{j_{22}}&\NVar{j_{23}}\\ \NVar{j_{31}}&\NVar{j_{32}}&\NVar{j_{33}}\end{Bmatrix}$ : $\mathit{9j}$ symbol
Symbols:: $\begin{pmatrix}\NVar{j_{1}}&\NVar{j_{2}}&\NVar{j_{3}}\\ \NVar{m_{1}}&\NVar{m_{2}}&\NVar{m_{3}}\end{pmatrix}$ : $\mathit{3j}$ symbol, $j,j_{r}$ : non-negative integers or non-negative integers plus one half., $r$ : nonnegative integer and $s$ : integer
Permalink:: http://dlmf.nist.gov/34.6.E1
Encodings:: pMML, png, TeX
See also:: Annotations for §34.6 and Ch.34

►

34.6.2

\begin{Bmatrix}j_{11}&j_{12}&j_{13}\\ j_{21}&j_{22}&j_{23}\\ j_{31}&j_{32}&j_{33}\end{Bmatrix}=\sum_{j}(-1)^{2j}(2j+1)\begin{Bmatrix}j_{11}% &j_{21}&j_{31}\\ j_{32}&j_{33}&j\end{Bmatrix}\begin{Bmatrix}j_{12}&j_{22}&j_{32}\\ j_{21}&j&j_{23}\end{Bmatrix}\begin{Bmatrix}j_{13}&j_{23}&j_{33}\\ j&j_{11}&j_{12}\end{Bmatrix}.

ⓘ

Symbols:: $\begin{Bmatrix}\NVar{j_{11}}&\NVar{j_{12}}&\NVar{j_{13}}\\ \NVar{j_{21}}&\NVar{j_{22}}&\NVar{j_{23}}\\ \NVar{j_{31}}&\NVar{j_{32}}&\NVar{j_{33}}\end{Bmatrix}$ : $\mathit{9j}$ symbol, $\begin{Bmatrix}\NVar{j_{1}}&\NVar{j_{2}}&\NVar{j_{3}}\\ \NVar{l_{1}}&\NVar{l_{2}}&\NVar{l_{3}}\end{Bmatrix}$ : $\mathit{6j}$ symbol and $j,j_{r}$ : non-negative integers or non-negative integers plus one half.
Referenced by:: §34.13
Permalink:: http://dlmf.nist.gov/34.6.E2
Encodings:: pMML, png, TeX
See also:: Annotations for §34.6 and Ch.34

►The

\mathit{9j}

symbol may also be written as a finite triple sum equivalent to a terminating generalized hypergeometric series of three variables with unit arguments. …

3: Guide to Searching the DLMF

… ►

term:

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

►

phrase:

any double-quoted sequence of textual words and numbers.

… ►

proximity operator:

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)
…

…

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

…

5: 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\left(\in\!T,n\right)

is the number of compositions of

n

with no 1’s, where again

T=\{2,3,4,\ldots\}

. … ►The Fibonacci numbers are determined recursively by … ►

26.11.6

c\left(\in\!T,n\right)=F_{n-1},

n\geq 1

ⓘ

Symbols:: $\in$ : element of, $c\left(\NVar{\mathrm{condition}},\NVar{n}\right)$ : 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).

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

…

7: 16.7 Relations to Other Functions

… ►For

\mathit{3j}

\mathit{6j}

\mathit{9j}

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).

8: 24.15 Related Sequences of Numbers

§24.15 Related Sequences of Numbers

►

§24.15(i) Genocchi Numbers

… ►

§24.15(ii) Tangent Numbers

… ►

§24.15(iii) Stirling Numbers

… ►

§24.15(iv) Fibonacci and Lucas Numbers

…

9: 26.14 Permutations: Order Notation

… ►As an example,

35247816

is an element of

\mathfrak{S}_{8}.

The inversion number is the number of pairs of elements for which the larger element precedes the smaller: … ► ►The Eulerian number, denoted

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

, is the number of permutations in

\mathfrak{S}_{n}

with exactly

k

descents. …The Eulerian number

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

is equal to the number of permutations in

\mathfrak{S}_{n}