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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A170860 a(0) = 1, a(1) = 0; a(2^i + j) = a(j) + 3a(j + 1) for 0 <= j < 2^i. 0
1, 0, 1, 3, 1, 3, 10, 6, 1, 3, 10, 6, 10, 33, 28, 9, 1, 3, 10, 6, 10, 33, 28, 9, 10, 33, 28, 36, 109, 117, 55, 12, 1, 3, 10, 6, 10, 33, 28, 9, 10, 33, 28, 36, 109, 117, 55, 12, 10, 33, 28, 36, 109, 117, 55, 39, 109, 117, 136, 363, 460, 282, 91, 15, 1, 3, 10, 6, 10, 33, 28, 9, 10, 33, 28, 36 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

LINKS

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

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: A128162 A257253 A067329 * A170845 A025238 A289066

Adjacent sequences:  A170857 A170858 A170859 * A170861 A170862 A170863

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 15 09:03 EST 2019. Contains 329144 sequences. (Running on oeis4.)