A151755 a(n) = 0 for n <= 4; for n >= 5, write n = 2^i + j, 0 <= j < 2^i; if j <= 2^i-2 then a(n) = 2*a(j) + a(j+1); if j = 2^i-1 then a(n) = 2*a(j) + a(j+1) + 1.

0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 3, 0, 0, 0, 0, 0, 0, 1, 2, 0, 0, 0, 0, 0, 1, 5, 7, 0, 0, 0, 0, 0, 0, 1, 2, 0, 0, 0, 0, 0, 1, 5, 6, 0, 0, 0, 0, 0, 1, 4, 4, 0, 0, 0, 0, 1, 7, 17, 15, 0, 0, 0, 0, 0, 0, 1, 2, 0, 0, 0, 0, 0, 1, 5, 6, 0, 0, 0, 0, 0, 1, 4, 4, 0, 0, 0, 0, 1, 7, 17, 14, 0, 0, 0, 0, 0, 1, 4

Offset

0,16

Links

Table of n, a(n) for n=0..102.

Example

May be written as a triangle:
  0,
  0,
  0, 0,
  0, 0, 0, 1,
  0, 0, 0, 0, 0, 0, 1, 3,
  0, 0, 0, 0, 0, 0, 1, 2, 0, 0, 0, 0, 0, 1, 5, 7,
  0, 0, 0, 0, 0, 0, 1, 2, 0, 0, 0, 0, 0, 1, 5, 6, 0, 0, 0, 0, 0, 1, 4, 4, 0, 0, 0, 0, 1, 7, 17, 15,
  ....
The rows converge to A151756.

Maple

f:=proc(n) option remember; local i, j;
if (n <= 4) then RETURN(0); fi;
i:=floor(log(n)/log(2)); j:=n-2^i;
if (j < 2^i-1) then RETURN(2*f(j)+f(j+1)); fi;
RETURN(2*f(j)+f(j+1)+1); end proc:
[seq(f(n), n=0..256)];

Crossrefs

Cf. A151756, A151795.

Sequence in context: A377131 A341743 A348945 * A325739 A181004 A051344

Adjacent sequences: A151752 A151753 A151754 * A151756 A151757 A151758

Keyword

nonn,tabf

Author

N. J. A. Sloane, Jun 21 2009

Status

approved