Conversation

Anyone know of a simple algorithm to systematically enumerate all the partitions of a set? (Ie all ways in which a set can be exhaustively partitioned into subsets)? Here for eg is me merely trying to count all the partitions of a set of 7. Probably some mistakes here.
Image
11
8
Replying to
With problems like these I usually solve for the first few integer cases and then find all the matching OEIS sequences, and from there get the formula for any n.
1
1