|
|
A240872
|
|
Number of partitions p of n into distinct parts such that max(p) = 4 + min(p).
|
|
3
|
|
|
0, 0, 0, 0, 0, 0, 1, 0, 2, 1, 2, 2, 3, 2, 2, 3, 3, 2, 2, 2, 4, 2, 2, 2, 3, 3, 2, 2, 3, 2, 3, 2, 3, 2, 2, 3, 3, 2, 2, 2, 4, 2, 2, 2, 3, 3, 2, 2, 3, 2, 3, 2, 3, 2, 2, 3, 3, 2, 2, 2, 4, 2, 2, 2, 3, 3, 2, 2, 3, 2, 3, 2, 3, 2, 2, 3, 3, 2, 2, 2, 4
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,9
|
|
LINKS
|
|
|
EXAMPLE
|
a(12) counts these 3 partitions: 84, 642, 5421.
|
|
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
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|