|
Search: id:A132463
|
|
|
| A132463 |
|
Number of partitions of n into distinct parts congruent to 0 or 1 modulo 3.</a>. |
|
+0
5
|
|
| 1, 0, 1, 2, 1, 1, 3, 2, 2, 5, 4, 3, 7, 7, 5, 10, 11, 8, 14, 17, 13, 20, 25, 19, 27, 36, 29, 37, 50, 43, 51, 69, 61, 69, 94, 86, 93, 126, 120, 125, 167, 164, 167, 220, 222, 222, 287, 297, 294, 373, 393, 386, 481, 516, 505, 617, 672, 657, 788, 868, 850, 1002, 1114, 1094
(list; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
LINKS
|
R. Zumkeller, Table of n, a(n) for n = 1..200
|
|
FORMULA
|
G.f.=Product((1+x^(3k))(1+x^(3k-2)),k=1..infinity) (offset 0). - Emeric Deutsch (deutsch(AT)duke.poly.edu), Aug 26 2007
|
|
EXAMPLE
|
a(7)=3 because we have 7, 61, and 43.
|
|
MAPLE
|
g:=product((1+x^(3*k))*(1+x^(3*k-2)), k=1..30): gser:=series(g, x=0, 100): seq(coeff(gser, x, n), n=1..65); - Emeric Deutsch (deutsch(AT)duke.poly.edu), Aug 26 2007
|
|
CROSSREFS
|
Cf. A032766, A035360, A003105, A132462.
Sequence in context: A058636 A132462 A104467 this_sequence A132844 A006843 A049456
Adjacent sequences: A132460 A132461 A132462 this_sequence A132464 A132465 A132466
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Aug 22 2007
|
|
|
Search completed in 0.002 seconds
|
