Count surjections from an n-element set onto a k-element set: the Stirling number of the
second kind S(n, k), i.e. the number of ways to partition n labelled elements into exactly
k non-empty unlabelled blocks (a surjection onto k elements is exactly a choice of which
block maps to which target element, and blocks are otherwise interchangeable until that
assignment – so partitioning first and multiplying by k! elsewhere gives the surjection
count; this function returns the partition count alone).