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!)
A241068 Number of partitions p of n into distinct parts such that max(p) >= -1 + 2*min(p). 3
0, 1, 0, 1, 1, 2, 3, 3, 5, 6, 8, 10, 13, 15, 20, 23, 29, 35, 42, 49, 60, 71, 84, 98, 116, 135, 158, 184, 214, 248, 286, 329, 380, 436, 500, 572, 654, 745, 848, 965, 1094, 1242, 1406, 1588, 1794, 2023, 2278, 2563, 2881, 3234, 3626, 4063, 4546, 5083, 5677 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,6

LINKS

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

EXAMPLE

a(8) counts these 5 partitions:  71, 62, 53, 521, 431.

MATHEMATICA

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

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

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

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

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

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

CROSSREFS

Cf. A241065, A240874, A241067, A241036.

Sequence in context: A193748 A322526 A039852 * A035938 A024503 A321286

Adjacent sequences:  A241065 A241066 A241067 * A241069 A241070 A241071

KEYWORD

nonn,easy

AUTHOR

Clark Kimberling, Apr 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 March 6 20:37 EST 2021. Contains 341850 sequences. (Running on oeis4.)