|
Search: id:A096914
|
|
|
| A096914 |
|
Number of partitions of 2*n into distinct parts with exactly two odd parts. |
|
+0
1
|
|
| 1, 2, 4, 7, 11, 17, 25, 36, 50, 69, 93, 124, 163, 212, 273, 349, 442, 556, 695, 863, 1066, 1310, 1602, 1950, 2364, 2854, 3433, 4115, 4916, 5854, 6951, 8229, 9716, 11442, 13441, 15752, 18419, 21490, 25021, 29074, 33718, 39031, 45101, 52024, 59910
(list; graph; listen)
|
|
|
OFFSET
|
2,2
|
|
|
FORMULA
|
G.f. for number of partitions of n into distinct parts with exactly k odd parts is x^(k^2)*Product(1+x^(2*m), m=1..infinity)/Product(1-x^(2*m), m=1..k).
|
|
MATHEMATICA
|
Drop[ Union[ CoefficientList[ Series[x^4* Product[1 + x^(2m), {m, 1, 50}] / Product[1 - x^(2m), {m, 1, 2}], {x, 0, 920}], x]], 1] (from Robert G. Wilson v Aug 21 2004)
|
|
CROSSREFS
|
Cf. A000009, A036469, A015128.
Sequence in context: A034379 A007000 A073472 this_sequence A004250 A084842 A096967
Adjacent sequences: A096911 A096912 A096913 this_sequence A096915 A096916 A096917
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Vladeta Jovovic (vladeta(AT)Eunet.yu), Aug 18 2004
|
|
EXTENSIONS
|
More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), Aug 21 2004
|
|
|
Search completed in 0.002 seconds
|
