A Pascal's Triangle in which each entry is a Stirling number of the second kind, representing the number of ways to partition n objects into k non-empty sets.
A Pascal's Triangle in which each entry is a Stirling number of the second kind, representing the number of ways to partition n objects into k non-empty sets.