login
A170858
a(0) = 1, a(1) = 0; a(2^i + j) = 3a(j) + a(j + 1) for 0 <= j < 2^i.
0
1, 0, 3, 3, 3, 3, 12, 12, 3, 3, 12, 12, 12, 21, 48, 39, 3, 3, 12, 12, 12, 21, 48, 39, 12, 21, 48, 48, 57, 111, 183, 120, 3, 3, 12, 12, 12, 21, 48, 39, 12, 21, 48, 48, 57, 111, 183, 120, 12, 21, 48, 48, 57, 111, 183, 129, 57, 111, 192, 201, 282, 516, 669, 363, 3, 3, 12, 12, 12, 21
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: A029630 A342400 A349924 * A024725 A269562 A214730
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Jan 02 2010
STATUS
approved