Definition:Stirling Numbers of the First Kind

Definition

Stirling Numbers of the First Kind come in two forms.

In the below, $n$ and $k$ are always non-negative integers.

Unsigned Stirling Numbers of the First Kind

These are defined recursively by:

$\displaystyle \left[{n \atop k}\right] = \begin{cases} \delta_{n k} & : k = 0 \text{ or } n = 0 \\ \left[{n-1 \atop k-1}\right] + \left({n-1}\right) \left[{n-1 \atop k}\right] & : \text{otherwise} \\ \end{cases}$

where $\delta_{nk}$ is the Kronecker delta.

Signed Stirling Numbers of the First Kind

These are defined recursively by:

$s(n,k) = \begin{cases} \delta_{n k} & : k = 0 \text{ or } n = 0 \\ s(n-1,k-1) - \left({n-1}\right) s(n-1,k) & : \text{otherwise} \\ \end{cases}$

where $\delta_{nk}$ is the Kronecker delta.

Also see

• Stirling's Triangles

Compare with

• Stirling Numbers of the Second Kind
• Pascal's Triangle

Notation

The notation given here for the unsigned type is that proposed by Jovan Karamata and publicised by Donald E. Knuth.

The notation given here for the signed type is similar to alternative versions of the unsigned. Usage is inconsistent in the literature.

Source of Name

This entry was named for James Stirling.

Sources

• Donald E. Knuth: The Art of Computer Programming: Volume 1: Fundamental Algorithms (1968) $\S 1.2.6$