= Stirling numbers of the first kind
{c}
{title2=$c(n,k)$}
The unsigned <Stirling numbers of the first kind> $c(n,k)$ count <permutations> of $n$ labels having exactly $k$ <disjoint permutation cycles>, including fixed points as one-cycles. Their signed version is $s(n,k)=(-1)^{n-k}c(n,k)$. Equivalently,
$$
x(x-1)\cdots(x-n+1)=\sum_{k=0}^n s(n,k)x^k.
$$
The sign convention must be stated because both versions are standard. For three labels, the unsigned counts for $k=1,2,3$ are $2,3,1$: two three-cycles, three transpositions with one fixed point, and the <identity permutation>. This cycle count differs from the <Stirling number of the second kind>, which counts unordered nonempty blocks without a cyclic order inside each block.
Back to article page