|
Search: id:A035386
|
|
|
| A035386 |
|
Number of partitions of n into parts congruent to 2 mod 3. |
|
+0
3
|
|
| 1, 0, 1, 0, 1, 1, 1, 1, 2, 1, 3, 2, 3, 3, 4, 4, 6, 5, 7, 7, 9, 9, 12, 11, 15, 15, 18, 19, 23, 23, 29, 29, 35, 37, 43, 45, 53, 55, 64, 68, 78, 82, 95, 99, 114, 121, 136, 145, 164, 173, 196, 208, 232, 248, 276, 294, 328, 349, 386, 413, 456, 486, 537, 572, 629, 673, 737, 787
(list; graph; listen)
|
|
|
OFFSET
|
0,9
|
|
|
COMMENT
|
a(n) = A116376(3*n). - Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), Feb 15 2006
|
|
FORMULA
|
a(n) = 1/n*Sum_{k=1..n} A078182(k)*a(n-k), a(0) = 1. - Vladeta Jovovic (vladeta(AT)Eunet.yu), Nov 21 2002
Euler transform of period 3 sequence [ 0, 1, 0, ...]. - Michael Somos Jul 24 2007
|
|
PROGRAM
|
(PARI) {a(n)= if(n<0, 0, polcoeff( 1/prod(k=1, n, 1-(k%3==2)*x^k, 1+x*O(x^n)), n))} /* Michael Somos Jul 24 2007 */
|
|
CROSSREFS
|
Cf. A035382, A035451.
Sequence in context: A029200 A051274 A025797 this_sequence A029164 A053262 A007359
Adjacent sequences: A035383 A035384 A035385 this_sequence A035387 A035388 A035389
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Olivier Gerard (ogerard(AT)ext.jussieu.fr)
|
|
|
Search completed in 0.002 seconds
|
