login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A170855 a(0) = 0, a(1) = 1; a(2^i + j) = a(j) + 3a(j + 1) for 0 <= j < 2^i. 0

%I #6 Feb 24 2021 02:48:19

%S 0,1,3,10,3,10,33,19,3,10,33,19,33,109,90,28,3,10,33,19,33,109,90,28,

%T 33,109,90,118,360,379,174,37,3,10,33,19,33,109,90,28,33,109,90,118,

%U 360,379,174,37,33,109,90,118,360,379,174,127,360,379,444,1198,1497,901,285,46

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

%H 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 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>

%K nonn

%O 0,3

%A _N. J. A. Sloane_, Jan 02 2010

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 20 10:27 EDT 2024. Contains 371820 sequences. (Running on oeis4.)