

A151569


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


16



1, 2, 4, 8, 4, 8, 16, 20, 4, 8, 16, 20, 16, 32, 52, 44, 4, 8, 16, 20, 16, 32, 52, 44, 16, 32, 52, 56, 64, 116, 148, 92, 4, 8, 16, 20, 16, 32, 52, 44, 16, 32, 52, 56, 64, 116, 148, 92, 16, 32, 52, 56, 64, 116, 148, 104, 64, 116, 160, 176, 244, 380, 388, 188, 4, 8, 16, 20, 16, 32, 52
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,2


COMMENTS

Equals 2*A160552+A151704.


LINKS

Ivan Neretin, Table of n, a(n) for n = 0..8191
David Applegate, Omar E. Pol and N. J. A. Sloane, The Toothpick Sequence and Other Sequences from Cellular Automata, Congressus Numerantium, Vol. 206 (2010), 157191. [There is a typo in Theorem 6: (13) should read u(n) = 4.3^(wt(n1)1) for n >= 2.]
N. J. A. Sloane, Catalog of Toothpick and Cellular Automata Sequences in the OEIS


MATHEMATICA

a = {1, 2}; Do[AppendTo[a, 2 a[[j]] + a[[j + 1]]], {i, 6}, {j, 2^i}]; a (* Ivan Neretin, Jul 04 2017 *)


CROSSREFS

For the recurrence a(2^i+j) = C*a(j) + D*a(j+1), a(0) = A, a(1) = B for following values of (A B C D) see: (0 1 1 1) A118977, (1 0 1 1) A151702, (1 1 1 1) A151570, (1 2 1 1) A151571, (0 1 1 2) A151572, (1 0 1 2) A151703, (1 1 1 2) A151573, (1 2 1 2) A151574, (0 1 2 1) A160552, (1 0 2 1) A151704, (1 1 2 1) A151568, (1 2 2 1) A151569, (0 1 2 2) A151705, (1 0 2 2) A151706, (1 1 2 2) A151707, (1 2 2 2) A151708.
Cf. A139250, A160552, A151568.
Sequence in context: A078479 A060968 A323651 * A016635 A133992 A294094
Adjacent sequences: A151566 A151567 A151568 * A151570 A151571 A151572


KEYWORD

nonn


AUTHOR

N. J. A. Sloane, May 25 2009


STATUS

approved



