number of ways to split n distinguishable objects into k indistinct sets - allowing for sets with 0 objects

308 Views Asked by At

After throughout searching both on this site and others I cannot seem to find a good explanation of how to solve this problem. I understand that if the objects are indistinguishable then it is a simple 'stars and bars' example. And that if all sets have at least one object then it is solved by the Stirling number of the second kind, but I am having trouble extending this to include empty sets. Any help is much appreciated.