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!)
A241037 Number of partitions p of n into distinct parts such that max(p) > 2*min(p). 7
0, 0, 0, 0, 1, 1, 2, 3, 4, 4, 8, 9, 11, 14, 18, 22, 28, 32, 39, 48, 58, 68, 81, 95, 112, 132, 155, 180, 210, 242, 280, 326, 374, 430, 494, 565, 646, 737, 840, 956, 1087, 1232, 1394, 1578, 1781, 2010, 2266, 2550, 2866, 3219, 3610, 4045, 4528, 5062, 5656, 6316 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,7

LINKS

Table of n, a(n) for n=0..55.

EXAMPLE

a(9) counts these 4 partitions:  {8,1}, {7,2}, {6,2,1}, {5,3,1}.

MATHEMATICA

z = 70; f[n_] := f[n] = Select[IntegerPartitions[n], Max[Length /@ Split@#] == 1 &];

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

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

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

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

CROSSREFS

Cf. A240874, A241035, A241036.

Sequence in context: A325329 A224038 A330147 * A097093 A056877 A267232

Adjacent sequences:  A241034 A241035 A241036 * A241038 A241039 A241040

KEYWORD

nonn,easy

AUTHOR

Clark Kimberling, Apr 15 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 April 12 17:48 EDT 2021. Contains 342929 sequences. (Running on oeis4.)