|
Search: id:A132462
|
|
|
| A132462 |
|
Number of partitions of n into distinct parts congruent to 0 or 2 modulo 3. |
|
+0
5
|
|
| 0, 1, 1, 0, 2, 1, 1, 3, 2, 2, 5, 2, 4, 7, 4, 7, 10, 6, 11, 14, 9, 17, 19, 14, 25, 26, 21, 36, 35, 31, 50, 47, 45, 69, 63, 64, 93, 84, 89, 125, 111, 124, 165, 147, 169, 216, 194, 227, 281, 254, 303, 363, 332, 400, 466, 432, 523, 595, 559, 680, 756, 721, 876, 956, 926, 1121
(list; graph; listen)
|
|
|
OFFSET
|
1,5
|
|
|
LINKS
|
R. Zumkeller, Table of n, a(n) for n = 1..200
|
|
FORMULA
|
G.f.=product((1+x^(3k))(1+x^(3k-1)),k=1..infinity) (offset 0). - Emeric Deutsch (deutsch(AT)duke.poly.edu), Aug 30 2007
|
|
EXAMPLE
|
a(8)=3 because we have 8, 62, and 53.
|
|
MAPLE
|
g:=product((1+x^(3*k))*(1+x^(3*k-1)), k=1..30): gser:=series(g, x=0, 100): seq(coeff(gser, x, n), n=1..70); - Emeric Deutsch (deutsch(AT)duke.poly.edu), Aug 30 2007
|
|
CROSSREFS
|
Cf. A007494, A035361, A003105, A132463.
Sequence in context: A110248 A094340 A058636 this_sequence A104467 A132463 A132844
Adjacent sequences: A132459 A132460 A132461 this_sequence A132463 A132464 A132465
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Aug 22 2007
|
|
|
Search completed in 0.002 seconds
|
