login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A241272 Number of partitions p of n into distinct parts such that max(p) = 5*min(p). 4
0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 2, 1, 0, 2, 1, 1, 2, 2, 2, 3, 3, 4, 6, 5, 5, 7, 7, 9, 11, 10, 11, 12, 12, 14, 18, 18, 18, 21, 21, 24, 27, 30, 30, 36, 37, 42, 47, 49, 54, 60, 64, 71, 81, 83, 91, 100, 107, 116, 129, 136, 147, 159, 172, 184, 200, 213, 228 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,13
LINKS
EXAMPLE
a(12) counts these 2 partitions: {10,2}, {5,4,2,1}.
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}] (* A241035 *)
Table[Count[f[n], p_ /; Max[p] == 3*Min[p]], {n, 0, z}] (* A241063 *)
Table[Count[f[n], p_ /; Max[p] == 4*Min[p]], {n, 0, z}] (* A241069 *)
Table[Count[f[n], p_ /; Max[p] == 5*Min[p]], {n, 0, z}] (* A241272 *)
Table[Count[f[n], p_ /; Max[p] == 6*Min[p]], {n, 0, z}] (* A241273 *)
CROSSREFS
Sequence in context: A025852 A190762 A025846 * A358991 A033780 A035210
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, Apr 18 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 16:40 EDT 2024. Contains 371916 sequences. (Running on oeis4.)