login
A239964
Number of partitions of n such that (number of distinct parts) = maximal multiplicity of the parts.
5
0, 1, 1, 1, 2, 3, 3, 4, 6, 5, 11, 12, 15, 21, 26, 30, 41, 52, 56, 82, 99, 118, 144, 189, 221, 279, 327, 405, 491, 600, 699, 860, 1038, 1230, 1470, 1754, 2106, 2487, 2970, 3489, 4148, 4883, 5779, 6763, 8024, 9284, 11006, 12780, 15029, 17452, 20405, 23660
OFFSET
0,5
EXAMPLE
a(8) counts these partitions: 8, 611, 422, 332, 3311, 32111.
MATHEMATICA
z = 58; d[p_] := d[p] = Length[DeleteDuplicates[p]]; m[p_] := Max[Map[Length, Split[p]]]; Table[Count[IntegerPartitions[n], p_ /; d[p] == m[p]], {n, 0, z}]
CROSSREFS
Sequence in context: A131187 A099072 A257241 * A290585 A106464 A093003
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, Mar 30 2014
STATUS
approved