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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A237824 Number of partitions of n such that 2*(least part) >= greatest part. 3
1, 2, 3, 4, 5, 7, 7, 10, 11, 13, 14, 19, 18, 23, 25, 29, 30, 38, 37, 46, 48, 54, 57, 70, 69, 80, 85, 97, 100, 118, 118, 137, 144, 159, 168, 193, 195, 220, 233, 259, 268, 303, 311, 348, 367, 399, 419, 469, 483, 532, 560, 610, 639, 704, 732, 801, 841, 908, 954 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

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

EXAMPLE

a(6) = 7 counts these partitions:  6, 42, 33, 222, 2211, 21111, 111111.

MATHEMATICA

z = 60; q[n_] := q[n] = IntegerPartitions[n];

Table[Count[q[n], p_ /; 2 Min[p] < Max[p]], {n, z}]  (* A237820 *)

Table[Count[q[n], p_ /; 2 Min[p] <= Max[p]], {n, z}] (* A237821 *)

Table[Count[q[n], p_ /; 2 Min[p] == Max[p]], {n, z}] (* A118096 *)

Table[Count[q[n], p_ /; 2 Min[p] > Max[p]], {n, z}]  (* A053263 *)

Table[Count[q[n], p_ /; 2 Min[p] >= Max[p]], {n, z}] (* A237824 *)

CROSSREFS

Cf. A237820, A237821, A118096, A053263, A237824.

Sequence in context: A325353 A117174 A320466 * A227972 A266620 A222415

Adjacent sequences:  A237821 A237822 A237823 * A237825 A237826 A237827

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 July 5 20:21 EDT 2020. Contains 335473 sequences. (Running on oeis4.)