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

1, 0, 3, 6, 3, 6, 21, 24, 3, 6, 21, 24, 21, 60, 111, 78, 3, 6, 21, 24, 21, 60, 111, 78, 21, 60, 111, 114, 183, 402, 489, 240, 3, 6, 21, 24, 21, 60, 111, 78, 21, 60, 111, 114, 183, 402, 489, 240, 21, 60, 111, 114, 183, 402, 489, 276, 183, 402, 561, 708, 1353, 2184, 1947, 726, 3

Offset

0,3

Links

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

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: A338947 A323503 A303129 * A123146 A016661 A376827

Adjacent sequences: A170856 A170857 A170858 * A170860 A170861 A170862

Keyword

nonn

Author

N. J. A. Sloane, Jan 02 2010

Status

approved