|
Search: id:A130126
|
|
|
| A130126 |
|
Number of partitions of n in which each even part has odd multiplicity. |
|
+0
7
|
|
| 1, 1, 2, 3, 4, 6, 10, 13, 17, 24, 33, 43, 58, 75, 98, 127, 161, 205, 262, 328, 414, 517, 641, 794, 982, 1205, 1475, 1803, 2197, 2664, 3230, 3896, 4693, 5640, 6754, 8077, 9647, 11479, 13637, 16178, 19152, 22624, 26695
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
FORMULA
|
G.f.: product_{n=1..inf} (1+q^(2n)-q^(4n))/((1-q^(2n-1))(1-q^(4n))).
|
|
EXAMPLE
|
a(5)=6 because we have 5,41,32,311,2111 and 11111 (221 does not qualify).
|
|
MAPLE
|
g:=product((1+q^(2*n)-q^(4*n))/((1-q^(2*n-1))*(1-q^(4*n))), n=1..50): gser:= series(g, q=0, 45): seq(coeff(gser, q, n), n=0..42); - Emeric Deutsch (deutsch(AT)duke.poly.edu), Aug 24 2007
|
|
CROSSREFS
|
Cf. A131942.
Sequence in context: A137172 A069744 A061018 this_sequence A121152 A089223 A094861
Adjacent sequences: A130123 A130124 A130125 this_sequence A130127 A130128 A130129
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Vladeta Jovovic (vladeta(AT)eunet.rs), Aug 01 2007
|
|
EXTENSIONS
|
More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Aug 24 2007
|
|
|
Search completed in 0.002 seconds
|
