login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A170854 a(0) = 0, a(1) = 1; a(2^i + j) = 3a(j) + 2a(j + 1) for 0 <= j < 2^i. 2
0, 1, 2, 7, 2, 7, 20, 25, 2, 7, 20, 25, 20, 61, 110, 79, 2, 7, 20, 25, 20, 61, 110, 79, 20, 61, 110, 115, 182, 403, 488, 241, 2, 7, 20, 25, 20, 61, 110, 79, 20, 61, 110, 115, 182, 403, 488, 241, 20, 61, 110, 115, 182, 403, 488, 277, 182, 403, 560, 709, 1352, 2185, 1946, 727, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

Table of n, a(n) for n=0..64.

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: A181284 A010697 A088666 * A215140 A278419 A197133

Adjacent sequences:  A170851 A170852 A170853 * A170855 A170856 A170857

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, Jan 02 2010

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 18 12:16 EST 2019. Contains 329261 sequences. (Running on oeis4.)