|
|
A240865
|
|
Number of partitions of n into distinct parts of which the number of even parts or the number of odd parts is a part.
|
|
7
|
|
|
0, 1, 0, 1, 0, 1, 2, 2, 3, 4, 6, 7, 8, 10, 12, 17, 16, 23, 23, 35, 32, 49, 45, 68, 62, 92, 85, 125, 119, 164, 159, 216, 216, 281, 288, 364, 384, 468, 502, 600, 660, 763, 852, 969, 1101, 1227, 1407, 1544, 1793, 1941, 2262, 2433, 2853, 3038, 3567, 3787, 4448
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,7
|
|
LINKS
|
|
|
EXAMPLE
|
a(9) counts these 4 partitions: 81, 621, 531, 432.
|
|
MATHEMATICA
|
z = 70; f[n_] := f[n] = Select[IntegerPartitions[n], Max[Length /@ Split@#] == 1 &];
t1 = Table[Count[f[n], p_ /; MemberQ[p, Count[Mod[p, 2], 0]]], {n, 0, z}] (* A240862 *)
t2 = Table[Count[f[n], p_ /; MemberQ[p, Count[Mod[p, 2], 1]]], {n, 0, z}] (* A240863, *)
t3 = Table[Count[f[n], p_ /; MemberQ[p, Count[Mod[p, 2], 0]] && MemberQ[p, Count[Mod[p, 2], 1]]], {n, 0, z}] (* A240864 *)
t4 = Table[Count[f[n], p_ /; MemberQ[p, Count[Mod[p, 2], 0]] || MemberQ[p, Count[Mod[p, 2], 1]]], {n, 0, z}] (* A240865 *)
t5 = Table[Count[f[n], p_ /; MemberQ[p, Count[Mod[p, 2], 0]] && ! MemberQ[p, Count[Mod[p, 2], 1]]], {n, 0, z}] (* A240866 *)
t6 = Table[Count[f[n], p_ /; ! MemberQ[p, Count[Mod[p, 2], 0]] && MemberQ[p, Count[Mod[p, 2], 1]]], {n, 0, z}] (* A240867 *)
t7 = Table[Count[f[n], p_ /; ! MemberQ[p, Count[Mod[p, 2], 0]] && ! MemberQ[p, Count[Mod[p, 2], 1]]], {n, 0, z}] (* A240868 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|