A151865 - 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 60, we have over 367,000 sequences, and we’ve crossed 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A151865

a(0)=1; a(1)=1; a(2)=3; for n>=3 if n=2^i + j with 0<=j<2^i then a(n)=2*a(j) + a(j + 1) except we add 1 if j=2^i-1.

%I #4 May 19 2020 07:25:39

%S 1,1,3,6,3,5,12,16,3,5,12,15,11,22,40,36,3,5,12,15,11,22,40,35,11,22,

%T 39,41,44,84,116,76,3,5,12,15,11,22,40,35,11,22,39,41,44,84,116,75,11,

%U 22,39,41,44,84,115,81,44,83,119,126,172,284,308,156,3,5,12,15,11,22,40,35,11

%N a(0)=1; a(1)=1; a(2)=3; for n>=3 if n=2^i + j with 0<=j<2^i then a(n)=2*a(j) + a(j + 1) except we add 1 if j=2^i-1.

%F I would very much like a g.f. for this sequence!

%Y Cf. A151843-A151874.

%K nonn

%O 0,3

%A _N. J. A. Sloane_, Jul 17 2009

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 2 09:50 EST 2023. Contains 367517 sequences. (Running on oeis4.)