|
|
A198254
|
|
Number of maximum-diversity partitions of n.
|
|
2
|
|
|
1, 1, 2, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 3, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
COMMENTS
|
A maximum-diversity partition of n is an integer partition whose part distribution maximizes the number of different compositions (=distinct partition orderings) that can be constructed from it.
An integer composition of n corresponds to a subgroup of the symmetric group on n element whose cycles are formed of contiguous integers.
|
|
LINKS
|
|
|
EXAMPLE
|
For n=17, there are 3 partitions reaching the maximum possible of 7!/2 =2520 distinct orderings : {4, 3, 2, 2, 2, 1, 1, 1, 1}, {4, 3, 2, 2, 1, 1, 1, 1, 1, 1} and {3, 3, 2, 2, 2, 1, 1, 1, 1, 1}.
|
|
CROSSREFS
|
A102462 gives the number of compositions that can be constructed from a maximum-diversity partition of n.
|
|
KEYWORD
|
nonn,nice
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|