# Stirling numbers of the second kind on Multiset

Stirling numbers of the second kind $$S(n, k)$$ count the number of ways to partition a set of $$n$$ elements into $$k$$ nonempty subsets. What if there were duplicate elements in the set? That is, the set is a multiset?

## migrated from stackoverflow.comJan 9 '11 at 15:40

This question came from our site for professional and enthusiast programmers.