A170871 a(0) = 1, a(1) = 2; a(2^i + j) = 2a(j) + 3a(j + 1) for 0 <= j < 2^i.

1, 2, 8, 28, 8, 28, 100, 80, 8, 28, 100, 80, 100, 356, 440, 184, 8, 28, 100, 80, 100, 356, 440, 184, 100, 356, 440, 460, 1268, 2032, 1432, 392, 8, 28, 100, 80, 100, 356, 440, 184, 100, 356, 440, 460, 1268, 2032, 1432, 392, 100, 356, 440, 460, 1268, 2032, 1432, 668, 1268

Offset

0,2

Links

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

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

Sequence in context: A287204 A299640 A197932 * A245996 A229935 A082107

Adjacent sequences: A170868 A170869 A170870 * A170872 A170873 A170874

Keyword

nonn

Author

N. J. A. Sloane, Jan 02 2010

Status

approved