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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A151572 a(0)=0, a(1)=1; a(2^i + j) = a(j) + 2*a(j+1) for 0 <= j < 2^i. 16
0, 1, 2, 5, 2, 5, 12, 9, 2, 5, 12, 9, 12, 29, 30, 13, 2, 5, 12, 9, 12, 29, 30, 13, 12, 29, 30, 33, 70, 89, 56, 17, 2, 5, 12, 9, 12, 29, 30, 13, 12, 29, 30, 33, 70, 89, 56, 17, 12, 29, 30, 33, 70, 89, 56, 37, 70, 89, 96, 173, 248, 201, 90, 21, 2, 5, 12, 9, 12, 29, 30, 13, 12, 29, 30, 33, 70 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

Ivan Neretin, Table of n, a(n) for n = 0..8191

David Applegate, Omar E. Pol and N. J. A. Sloane, The Toothpick Sequence and Other Sequences from Cellular Automata

N. J. A. Sloane, Catalog of Toothpick and Cellular Automata Sequences in the OEIS

MATHEMATICA

a = {0, 1}; Do[AppendTo[a, a[[j]] + 2 a[[j + 1]]], {i, 6}, {j, 2^i}]; a (* Ivan Neretin, Jun 28 2017 *)

CROSSREFS

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.

Sequence in context: A087272 A107060 A016589 * A166376 A089122 A268789

Adjacent sequences:  A151569 A151570 A151571 * A151573 A151574 A151575

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, May 25 2009

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified February 19 06:46 EST 2018. Contains 299330 sequences. (Running on oeis4.)