A325987 Irregular triangle read by rows where T(n,k) is the number of integer partitions of n with k submultisets, k > 0.
1, 0, 1, 0, 1, 1, 0, 1, 0, 2, 0, 1, 1, 1, 1, 1, 0, 1, 0, 2, 0, 3, 0, 1, 0, 1, 1, 3, 0, 1, 1, 2, 1, 1, 0, 1, 0, 3, 0, 3, 0, 4, 0, 1, 0, 3, 0, 1, 1, 3, 1, 3, 0, 3, 2, 1, 0, 4, 0, 1, 1, 1, 0, 1, 0, 5, 0, 3, 0, 5, 0, 3, 0, 6, 0, 1, 0, 3, 0, 2, 0, 1, 0, 1, 1, 4, 0
Offset: 0
Examples
Triangle begins: 1 0 1 0 1 1 0 1 0 2 0 1 1 1 1 1 0 1 0 2 0 3 0 1 0 1 1 3 0 1 1 2 1 1 0 1 0 3 0 3 0 4 0 1 0 3 0 1 1 3 1 3 0 3 2 1 0 4 0 1 1 1 0 1 0 5 0 3 0 5 0 3 0 6 0 1 0 3 0 2 0 1 0 1 1 4 0 5 0 7 2 1 1 4 0 1 2 5 0 3 0 2 1 0 0 2 Row n = 7 counts the following partitions (empty columns not shown): (7) (43) (322) (421) (31111) (3211) (52) (331) (2221) (22111) (61) (511) (4111) (211111) (1111111)
Links
- Alois P. Heinz, Rows n = 0..60, flattened
Crossrefs
Programs
-
Mathematica
Table[Length[Select[IntegerPartitions[n],Times@@(1+Length/@Split[#])==k&]],{n,0,10},{k,1,Max@@(Times@@(1+Length/@Split[#])&)/@IntegerPartitions[n]}]
Comments