
Last chance! 50% off unlimited learning
Sale ends in
Denote the number of ways to partition a set of n objects into k non-empty subsets
stirling2(n, k)
a "list" containing the following components:
S | the stirling number of the second kind | |
SM | a matrix showing, for each k (on the columns) in how many ways the n objects (on the rows) can be partitioned |
(integer): the number of the objects
(integer <=n): the number of the non-empty subsets (buckets)
Antonio D'Ambrosio antdambr@unina.it
Comtet, L. (1974). Advanced Combinatorics: The art of finite and infinite expansions. D. Reidel, Dordrecth, The Netherlands.