A101615 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

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”).

Other ways to Give

A101615

Number of representations of n as a sum of the Jacobsthal numbers A078008 (2 is allowed twice as a part).

%I #2 Mar 30 2012 18:59:02

%S 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,

%T 2,2,1,1,1,1,2,2,2,2,2,2,1,1,1,1,2

%N Number of representations of n as a sum of the Jacobsthal numbers A078008 (2 is allowed twice as a part).

%C Partial sums are A101616.

%F G.f.: Product{k>=0, 1+x^A078008(k)}/2

%Y Cf. A026465.

%K easy,nonn

%O 0,3

%A _Paul Barry_, Dec 09 2004