This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A239966 Number of partitions of n such that (number of distinct parts) =  minimal multiplicity of the parts. 1
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,7 LINKS EXAMPLE a(8) counts these 4 partitions :  8, 3311, 22211, 221111. 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}] CROSSREFS Cf. A239964, A239948. Sequence in context: A060367 A267451 A062968 * A304406 A053197 A301768 Adjacent sequences:  A239963 A239964 A239965 * A239967 A239968 A239969 KEYWORD nonn,easy AUTHOR Clark Kimberling, Mar 30 2014 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified March 26 04:32 EDT 2019. Contains 321481 sequences. (Running on oeis4.)