A239966 Number of partitions of n such that (number of distinct parts) = minimal multiplicity of the parts.

0, 1, 1, 1, 1, 1, 2, 2, 4, 3, 6, 5, 8, 6, 13, 6, 15, 10, 19, 12, 24, 15, 33, 22, 38, 28, 52, 39, 61, 51, 78, 66, 94, 85, 118, 103, 140, 130, 168, 165, 194, 190, 244, 230, 274, 285, 328, 327, 394, 386, 449, 485, 522, 540, 646, 639, 712, 790, 846, 880, 1025

Offset: 0

Author

Clark Kimberling, Mar 30 2014

Keywords

• nonn
• easy

Examples

			a(8) counts these 4 partitions :  8, 3311, 22211, 221111.
		

Crossrefs

Cf. A239964, A239948.

Programs

Mathematica

z = 61; d[p_] := d[p] = Length[DeleteDuplicates[p]]; m[p_] := Min[Map[Length, Split[p]]]; Table[Count[IntegerPartitions[n], p_ /; d[p] == m[p]], {n, 0, z}]