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

1, 1, 5, 13, 5, 13, 41, 49, 5, 13, 41, 49, 41, 121, 221, 157, 5, 13, 41, 49, 41, 121, 221, 157, 41, 121, 221, 229, 365, 805, 977, 481, 5, 13, 41, 49, 41, 121, 221, 157, 41, 121, 221, 229, 365, 805, 977, 481, 41, 121, 221, 229, 365, 805, 977, 553, 365, 805, 1121, 1417, 2705

Offset

0,3

Links

Matthew House, Table of n, a(n) for n = 0..10000

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: A298497 A246922 A246921 * A293958 A089619 A337513

Adjacent sequences: A170861 A170862 A170863 * A170865 A170866 A170867

Keyword

nonn

Author

N. J. A. Sloane, Jan 02 2010

Status

approved