|
|
A211352
|
|
Refined triangle A211356: T(n,k) is the number of partitions up to rotation of an n-set that are of type k (k-th integer partition, defined by A194602).
|
|
1
|
|
|
1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 2, 2, 3, 1, 2, 1, 1, 3, 4, 9, 3, 10, 1, 5, 3, 3, 1, 1, 3, 5, 15, 5, 30, 3, 15, 15, 10, 1, 15, 3, 5, 1, 1, 4, 7, 29, 10, 70, 7, 56, 54, 37, 4, 105, 21, 35, 1, 18, 29, 37, 4, 7, 7, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,8
|
|
COMMENTS
|
The rows are counted from 1, the columns from 0.
Row lengths: 1,2,3,5,7,11... (partition numbers A000041)
Row sums: 1,2,3,7,12,43... (A084423)
Row maxima: 1,1,1,2,3,10,30,105,420,1268,6300...
Distinct entries per row: 1,1,1,2,3,6,6,13,17,25,25...
Rightmost columns are those from the triangle of circular binomial coefficients A047996 without the second column (i.e.triangle A037306).
|
|
LINKS
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
tabf,nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|