login
A170862
a(0) = 1, a(1) = 0; a(2^i + j) = 3a(j) + 3a(j + 1) for 0 <= j < 2^i.
0
1, 0, 3, 9, 3, 9, 36, 36, 3, 9, 36, 36, 36, 135, 216, 117, 3, 9, 36, 36, 36, 135, 216, 117, 36, 135, 216, 216, 513, 1053, 999, 360, 3, 9, 36, 36, 36, 135, 216, 117, 36, 135, 216, 216, 513, 1053, 999, 360, 36, 135, 216, 216, 513, 1053, 999, 459, 513, 1053, 1296, 2187, 4698, 6156
OFFSET
0,3
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.]
CROSSREFS
Sequence in context: A010707 A097665 A284564 * A083996 A010259 A255583
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Jan 02 2010
STATUS
approved