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!)
A241089     Number of partitions p of n into distinct parts such that max(p) > 2*(number of parts of p). 8
0, 0, 0, 1, 1, 1, 2, 3, 4, 5, 6, 8, 10, 13, 16, 20, 24, 29, 35, 42, 50, 61, 72, 85, 101, 118, 138, 161, 188, 218, 254, 293, 339, 391, 450, 515, 591, 675, 771, 878, 999, 1135, 1289, 1460, 1652, 1868, 2108, 2376, 2676, 3009, 3379, 3793, 4250, 4760, 5325, 5952 (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 5 partitions:  9, 81, 72, 63, 54.

MATHEMATICA

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

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

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

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

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

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

CROSSREFS

Cf. A241085, A241086, A241087, A241088.

Sequence in context: A141283 A276828 A309715 * A186445 A080078 A036415

Adjacent sequences:  A241086 A241087 A241088 * A241090 A241091 A241092

KEYWORD

nonn,easy

AUTHOR

Clark Kimberling, Apr 17 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 October 17 17:21 EDT 2021. Contains 348065 sequences. (Running on oeis4.)