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!)
A240874 Number of partitions p of n into distinct parts such that max(p) < 2*min(p). 7
0, 1, 1, 1, 1, 2, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 5, 4, 5, 6, 6, 7, 7, 7, 8, 9, 10, 10, 11, 11, 12, 14, 14, 15, 17, 17, 18, 19, 20, 23, 24, 25, 26, 28, 29, 31, 34, 35, 37, 40, 42, 44, 46, 48, 51, 55, 58, 61, 64, 67, 70, 75, 77, 82, 87, 90, 96, 101, 105, 111 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,6

LINKS

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

EXAMPLE

a(12) counts these 3 partitions:  {12}, {7,5}, {5,4,3}.

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. A241035, A241036, A241037.

Sequence in context: A235645 A325357 A294107 * A029379 A058776 A233296

Adjacent sequences:  A240871 A240872 A240873 * A240875 A240876 A240877

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 September 24 01:21 EDT 2020. Contains 337315 sequences. (Running on oeis4.)