cp's OEIS Frontend

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

%I A151703 #11 Feb 24 2021 02:48:18
%S A151703 1,0,1,2,1,2,5,4,1,2,5,4,5,12,13,6,1,2,5,4,5,12,13,6,5,12,13,14,29,38,
%T A151703 25,8,1,2,5,4,5,12,13,6,5,12,13,14,29,38,25,8,5,12,13,14,29,38,25,16,
%U A151703 29,38,41,72,105,88,41,10,1,2,5,4,5,12,13,6,5,12,13,14,29,38,25,8,5,12,13,14
%N A151703 a(0)=1, a(1)=0; a(2^i+j) = a(j) + 2*a(j+1) for 0 <= j < 2^i.
%H A151703 Ivan Neretin, <a href="/A151703/b151703.txt">Table of n, a(n) for n = 0..8191</a>
%H A151703 David Applegate, Omar E. Pol and N. J. A. Sloane, <a href="/A000695/a000695_1.pdf">The Toothpick Sequence and Other Sequences from Cellular Automata</a>, 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.]
%H A151703 N. J. A. Sloane, <a href="/wiki/Catalog_of_Toothpick_and_CA_Sequences_in_OEIS">Catalog of Toothpick and Cellular Automata Sequences in the OEIS</a>
%p A151703 See A151702 for Maple code.
%t A151703 a = {1, 0}; Do[AppendTo[a, a[[j]] + 2 a[[j + 1]]], {i, 6}, {j, 2^i}]; a (* _Ivan Neretin_, Jul 04 2017 *)
%Y A151703 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.
%Y A151703 If first two terms are dropped, same as A151691.
%K A151703 nonn
%O A151703 0,4
%A A151703 _N. J. A. Sloane_, Jun 06 2009