A160018 A175099 with a(3) changed from 0 to 1.

0, 0, 0, 1, 1, 0, 0, 2, 3, 0, 0, 2, 2, 0, 0, 4, 7, 0, 0, 2, 2, 0, 0, 4, 6, 0, 0, 4, 4, 0, 0, 8, 15, 0, 0, 2, 2, 0, 0, 4, 6, 0, 0, 4, 4, 0, 0, 8, 14, 0, 0, 4, 4, 0, 0, 8, 12, 0, 0, 8, 8, 0, 0, 16, 31, 0, 0, 2, 2, 0, 0, 4, 6, 0, 0, 4, 4, 0, 0, 8, 14, 0, 0, 4, 4, 0, 0, 8, 12, 0, 0, 8, 8, 0, 0, 16, 30, 0, 0, 4, 4, 0

Offset: 0

Author

N. J. A. Sloane, Feb 07 2010

Keywords

• nonn

Links

• David Applegate, Omar E. Pol and N. J. A. Sloane, The Toothpick Sequence and Other Sequences from Cellular Automata, Congressus Numerantium, Vol. 206 (2010), 157-191. [There is a typo in Theorem 6: (13) should read u(n) = 4.3^(wt(n-1)-1) for n >= 2.]
• N. J. A. Sloane, Catalog of Toothpick and Cellular Automata Sequences in the OEIS

Crossrefs

Cf. A160125, A175098, A175099.

Formula

a(n) = a(1) = 0; for k >= 1, a(2^k) = 2^(k-1)-1, a(2^k+i) = 2*a(i) for 1 <= i < 2^k.