Unsigned Stirling number of the first kind (source code)

= Unsigned Stirling number of the first kind
{title2=$c(n,k)$}

The <unsigned Stirling number of the first kind> $c(n,k)$ is the number of <permutations> on $n$ labels with $k$ <disjoint permutation cycles>. It satisfies
$$
c(n,k)=c(n-1,k-1)+(n-1)c(n-1,k),\qquad c(0,0)=1,
$$
with impossible indices giving zero. Either label $n$ forms its own cycle, or it is inserted immediately after one of the $n-1$ old labels in an existing cycle; deleting $n$ reverses either construction. Thus $c(4,2)=c(3,1)+3c(3,2)=2+9=11$. The same <recurrence relation> gives the coefficient identity $x(x+1)\cdots(x+n-1)=\sum_kc(n,k)x^k$.