|
|
A119269
|
|
Table by antidiagonals: number of m-dimensional partitions of n up to conjugacy, for n >= 1, m >= 0.
|
|
9
|
|
|
1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 3, 2, 1, 1, 1, 4, 4, 2, 1, 1, 1, 6, 6, 4, 2, 1, 1, 1, 8, 11, 7, 4, 2, 1, 1, 1, 12, 19, 13, 7, 4, 2, 1, 1, 1, 16, 33, 25, 14, 7, 4, 2, 1, 1, 1, 22, 55, 49, 27, 14, 7, 4, 2, 1, 1, 1, 29, 95, 93, 55, 28, 14, 7, 4, 2, 1, 1, 1, 40, 158, 181, 111, 57, 28, 14, 7, 4, 2, 1, 1
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,8
|
|
COMMENTS
|
Partitions are considered as generalized Ferrers diagrams; any permutation of the axes produces a conjugate.
|
|
LINKS
|
|
|
FORMULA
|
a(n,m) = a(n,n-2) for m >= n-1.
|
|
EXAMPLE
|
Table starts:
1, 1, 1, 1, 1
1, 1, 1, 1, 1
1, 2, 2, 2, 2
1, 3, 4, 4, 4
1, 4, 6, 7, 7
1, 6, 11, 13, 14
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|