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

 

Logo

Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS").
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A237829 Number of partitions of n such that 2*(least part) - 1 = greatest part. 5
1, 1, 1, 1, 2, 1, 2, 3, 2, 2, 5, 3, 4, 5, 5, 6, 8, 6, 8, 10, 10, 10, 15, 12, 14, 17, 18, 20, 23, 21, 26, 29, 30, 31, 39, 38, 42, 46, 49, 52, 61, 60, 68, 74, 77, 83, 94, 95, 104, 112, 122, 128, 143, 144, 159, 172, 181, 192, 212, 219, 237, 253, 271, 285 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,5

LINKS

Table of n, a(n) for n=1..64.

EXAMPLE

a(8) = 3 counts these partitions:  53, 332, 11111111.

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-A237828, A000041.

Sequence in context: A112218 A172366 A132148 * A159974 A143866 A155002

Adjacent sequences:  A237826 A237827 A237828 * A237830 A237831 A237832

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 5 05:51 EST 2020. Contains 338944 sequences. (Running on oeis4.)