|
| |
|
|
A300862
|
|
Solution to 1 = Sum_y Product_{k in y} a(k) for each n > 0, where the sum is over all integer partitions of n with an odd number of parts.
|
|
6
|
|
|
|
1, 1, 0, 0, -1, -1, 0, 1, 1, 0, -2, -3, -2, 2, 7, 6, -3, -15, -19, -2, 32, 54, 24, -64, -153, -123, 95, 389, 444, -43, -966, -1475, -516, 2066, 4414, 3092, -3874, -12480, -12936, 3847, 32445, 45494, 8950, -77282, -147663, -86313, 157456, 435623, 399041, -229616, -1211479, -1535700, -73132
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,11
|
|
|
LINKS
|
|
|
|
MATHEMATICA
|
a[n_]:=a[n]=1-Sum[Times@@a/@y, {y, Select[IntegerPartitions[n], Length[#]>1&&OddQ[Length[#]]&]}];
Array[a, 40]
|
|
|
CROSSREFS
|
Cf. A027193, A063834, A220418, A279374, A290261, A290971, A298118, A299202, A299203, A300301, A300436, A300439, A300863, A300864, A300865, A300866.
|
|
|
KEYWORD
|
sign
|
|
|
AUTHOR
|
|
|
|
STATUS
|
approved
|
| |
|
|
