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!)
A240873     Number of partitions p of n into distinct parts such that max(p) = 5 + min(p). 3
0, 0, 0, 0, 0, 0, 0, 1, 0, 2, 1, 2, 3, 3, 3, 4, 4, 4, 5, 4, 3, 6, 4, 4, 5, 3, 4, 6, 4, 4, 4, 4, 4, 6, 4, 3, 5, 4, 4, 6, 3, 4, 5, 4, 4, 5, 4, 4, 5, 4, 3, 6, 4, 4, 5, 3, 4, 6, 4, 4, 4, 4, 4, 6, 4, 3, 5, 4, 4, 6, 3, 4, 5, 4, 4, 5, 4, 4, 5, 4, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,10

LINKS

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

EXAMPLE

a(12) counts these 3 partitions:  732, 651, 6321.

MATHEMATICA

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

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

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

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

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

CROSSREFS

Cf. A171182, A240871, A240872.

Sequence in context: A228506 A228285 A020908 * A208882 A186519 A241091

Adjacent sequences:  A240870 A240871 A240872 * A240874 A240875 A240876

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 27 03:21 EDT 2020. Contains 337380 sequences. (Running on oeis4.)