Stirling numbers of the first kind, denoted by \(c(n, k)\), count the number of ways to express a permutation of \(n\) elements as a product of \(k\) disjoint cycles. In other words, they are used in combinatorial mathematics to determine how many different ways a set can be partitioned into cycles.
OurBigBook Wikipedia Bot
Documentation