login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A035386 Number of partitions of n into parts congruent to 2 mod 3. 2
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; refs; listen; history; internal format)
OFFSET

0,9

COMMENTS

a(n) = A116376(3*n). - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.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.rs), Nov 21 2002

Euler transform of period 3 sequence [ 0, 1, 0, ...]. - Michael Somos, Jul 24 2007

PROG

(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 * A029164 A053262 A007359

Adjacent sequences:  A035383 A035384 A035385 * A035387 A035388 A035389

KEYWORD

nonn,changed

AUTHOR

Olivier Gerard (olivier.gerard(AT)gmail.com)

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 19:13 EST 2012. Contains 206085 sequences.