This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A239962 Number of partitions of n such that (number of distinct parts) =  multiplicity of the least part. 0
 1, 1, 1, 1, 2, 2, 3, 3, 6, 4, 10, 9, 12, 16, 23, 21, 34, 42, 45, 64, 76, 92, 113, 144, 166, 214, 247, 308, 365, 459, 523, 642, 774, 922, 1094, 1304, 1556, 1830, 2191, 2573, 3039, 3570, 4242, 4911, 5859, 6756, 8000, 9244, 10916, 12581, 14780, 17048, 19894 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,5 LINKS EXAMPLE a(8) counts these 6 partitions:  611, 44, 422, 3311, 32111, 2222. MATHEMATICA z = 54; d[p_] := d[p] = Length[DeleteDuplicates[p]]; Table[Count[IntegerPartitions[n], p_ /; d[p] == Count[p, Min[p]]], {n, 0, z}] CROSSREFS Cf. A239960. Sequence in context: A051715 A143269 A036817 * A175175 A116417 A271410 Adjacent sequences:  A239959 A239960 A239961 * A239963 A239964 A239965 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 February 19 07:51 EST 2019. Contains 320309 sequences. (Running on oeis4.)