Stirling numbers of the first kind

In mathematics, especially in combinatorics, Stirling numbers of the first kind arise in the study of permutations. In particular, the unsigned Stirling numbers of the first kind count permutations according to their number of cycles (counting fixed points as cycles of length one).^[1]

The Stirling numbers of the first and second kind can be understood as inverses of one another when viewed as triangular matrices. This article is devoted to specifics of Stirling numbers of the first kind. Identities linking the two kinds appear in the article on Stirling numbers.

^ Wilf, Herbert S. (1990). Generatingfunctionology. San Diego, CA, USA: Academic Press. p. 73. ISBN 978-148324857-8.{{cite book}}: CS1 maint: date and year (link)

[:0-1] Wilf, Herbert S. (1990). Generatingfunctionology. San Diego, CA, USA: Academic Press. p. 73. ISBN 978-148324857-8.{{cite book}}: CS1 maint: date and year (link)

[1]