This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A237827 Number of partitions of n such that 5*(least part) = greatest part. 5
 0, 0, 0, 0, 0, 1, 1, 2, 3, 5, 7, 11, 13, 19, 24, 32, 39, 52, 61, 77, 93, 114, 133, 164, 188, 226, 261, 309, 353, 417, 471, 549, 622, 717, 808, 933, 1042, 1191, 1334, 1516, 1690, 1921, 2131, 2407, 2674, 3006, 3330, 3744, 4135, 4628, 5116, 5708, 6294, 7020 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,8 LINKS Alois P. Heinz, Table of n, a(n) for n = 1..1000 EXAMPLE a(8) = 2 counts these partitions:  521, 5111. MATHEMATICA z = 64; q[n_] := q[n] = IntegerPartitions[n]; Table[Count[q[n], p_ /; 3 Min[p] = = Max[p]], {n, z}]     (* A237825*) Table[Count[q[n], p_ /; 4 Min[p] = = Max[p]], {n, z}]     (* A237826 *) Table[Count[q[n], p_ /; 5 Min[p] = = Max[p]], {n, z}]     (* A237827 *) Table[Count[q[n], p_ /; 2 Min[p] + 1 = = Max[p]], {n, z}] (* A237828 *) Table[Count[q[n], p_ /; 2 Min[p] - 1 = = Max[p]], {n, z}] (* A237829 *) CROSSREFS Cf. A237757, A237825, A237826, A237829, A237829, A000041. Sequence in context: A285983 A020588 A227202 * A114111 A155108 A222565 Adjacent sequences:  A237824 A237825 A237826 * A237828 A237829 A237830 KEYWORD nonn,easy AUTHOR Clark Kimberling, Feb 16 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 July 19 22:14 EDT 2019. Contains 325168 sequences. (Running on oeis4.)