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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A170862 a(0) = 1, a(1) = 0; a(2^i + j) = 3a(j) + 3a(j + 1) for 0 <= j < 2^i. 0
1, 0, 3, 9, 3, 9, 36, 36, 3, 9, 36, 36, 36, 135, 216, 117, 3, 9, 36, 36, 36, 135, 216, 117, 36, 135, 216, 216, 513, 1053, 999, 360, 3, 9, 36, 36, 36, 135, 216, 117, 36, 135, 216, 216, 513, 1053, 999, 360, 36, 135, 216, 216, 513, 1053, 999, 459, 513, 1053, 1296, 2187, 4698, 6156 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

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

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: A010707 A097665 A284564 * A083996 A010259 A255583

Adjacent sequences:  A170859 A170860 A170861 * A170863 A170864 A170865

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 January 21 08:28 EST 2019. Contains 319351 sequences. (Running on oeis4.)