Stirling numbers of 1st/2nd kind

Layer 0 — Mathematicsin the combinatorics subtree

c(n,k) signed = coeffs of x(x−1)…(x−n+1); S(n,k) = # partitions of n into k non-empty blocks. Pascal-like recurrences.

Related concepts

Explore Stirling numbers of 1st/2nd kind on the interactive knowledge graph →