cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A198254 Number of maximum-diversity partitions of n.

Original entry on oeis.org

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
Offset: 0

Views

Author

Olivier Gérard, Oct 22 2011

Keywords

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.

Examples

			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.