The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,5 LINKS 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 Cf. A239948, A239966. Sequence in context: A131187 A099072 A257241 * A290585 A106464 A093003 Adjacent sequences:  A239961 A239962 A239963 * A239965 A239966 A239967 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 September 30 22:26 EDT 2020. Contains 337440 sequences. (Running on oeis4.)