login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A101615
Number of representations of n as a sum of the Jacobsthal numbers A078008 (2 is allowed twice as a part).
2
1, 1, 2, 2, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 2
OFFSET
0,3
COMMENTS
Partial sums are A101616.
FORMULA
G.f.: Product{k>=0, 1+x^A078008(k)}/2
CROSSREFS
Cf. A026465.
Sequence in context: A101598 A342461 A157129 * A246359 A328114 A343504
KEYWORD
easy,nonn
AUTHOR
Paul Barry, Dec 09 2004
STATUS
approved