|
Search: id:A117958
|
|
|
| A117958 |
|
Number of partitions of n into odd parts, each part occurring an odd number of times. |
|
+0
3
|
|
| 1, 1, 0, 2, 1, 2, 2, 2, 4, 4, 6, 4, 8, 6, 10, 12, 15, 14, 18, 20, 22, 30, 30, 36, 40, 51, 50, 66, 66, 80, 86, 102, 108, 130, 138, 164, 182, 200, 224, 250, 280, 306, 352, 378, 428, 470, 530, 566, 660, 703, 792, 854, 960, 1034, 1172, 1264, 1402, 1520, 1688, 1828, 2036
(list; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
FORMULA
|
G.f.=product(1+x^(2k-1)/(1-x^(4k-2)), k=1..infinity).
|
|
EXAMPLE
|
a(8)=4 because we have [7,1],[5,3],[5,1,1,1], and [3,1,1,1,1,1].
|
|
MAPLE
|
g:=product(1+x^(2*k-1)/(1-x^(4*k-2)), k=1..50): gser:=series(g, x=0, 70): seq(coeff(gser, x, n), n=0..65);
|
|
CROSSREFS
|
Sequence in context: A009213 A072209 A060169 this_sequence A113401 A071227 A108115
Adjacent sequences: A117955 A117956 A117957 this_sequence A117959 A117960 A117961
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Emeric Deutsch (deutsch(AT)duke.poly.edu), Apr 08 2006
|
|
|
Search completed in 0.002 seconds
|
