q-Stirling numbers

SearchAdvancedHelp

(0.001 seconds)

1—10 of 223 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: 17.3 $q$-Elementary and $q$-Special Functions

… ►

§17.3(iii) Bernoulli Polynomials; Euler and Stirling Numbers

… ►

$q$-Euler Numbers

… ►

$q$-Stirling Numbers

►

17.3.9 $$a_{m,s}\left(q\right)=\frac{q^{-\left(\genfrac{}{}{0.0pt}{}{s}{2}\right)}{(1-q)}^s}{{(q;q)}_s}\sum _{j=0}^s{(-1)}^j{q}^{\left(\genfrac{}{}{0.0pt}{}{j}{2}\right)}{\left[\genfrac{}{}{0.0pt}{}{s}{j}\right]}_q\frac{{(1-q^{s-j})}^m}{{(1-q)}^m}.$$

ⓘ

Defines:

$a_{m,s}\left(q\right)$: $q$-Stirling number

Symbols:

$\left(\genfrac{}{}{0.0pt}{}{m}{n}\right)$: binomial coefficient, ${(a;q)}_n$: $q$-Pochhammer symbol (or $q$-shifted factorial), ${\left[\genfrac{}{}{0.0pt}{}{n}{m}\right]}_q$: $q$-binomial coefficient (or Gaussian polynomial), $q$: complex base, $j$: nonnegative integer, $m$: nonnegative integer and $s$: nonnegative integer

Permalink:

http://dlmf.nist.gov/17.3.E9

Encodings:

pMML, png, TeX

See also:

Annotations for §17.3(iii), §17.3(iii), §17.3 and Ch.17

… ►The $A_{m,s}\left(q\right)$ are always polynomials in $q$, and the $a_{m,s}\left(q\right)$ are polynomials in $q$ for $0\le s\le m$. …

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

4: 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$. …

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

…

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

…

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

…

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

…

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

…

10: 26.8 Set Partitions: Stirling Numbers

§26.8 Set Partitions: Stirling Numbers

►

§26.8(i) Definitions

… ► … ►

§26.8(v) Identities

… ►

§26.8(vi) Relations to Bernoulli Numbers

…