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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A151574 a(0)=1, a(1)=2; a(2^i + j) = a(j) + 2*a(j+1) for 0 <= j < 2^i. 16
1, 2, 5, 12, 5, 12, 29, 22, 5, 12, 29, 22, 29, 70, 73, 32, 5, 12, 29, 22, 29, 70, 73, 32, 29, 70, 73, 80, 169, 216, 137, 42, 5, 12, 29, 22, 29, 70, 73, 32, 29, 70, 73, 80, 169, 216, 137, 42, 29, 70, 73, 80, 169, 216, 137, 90, 169, 216, 233, 418, 601, 490, 221, 52, 5, 12, 29, 22, 29 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

Equals 2*A151572 + A151703.

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 = {1, 2}; 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: A127532 A127530 A279347 * A110020 A070266 A125199

Adjacent sequences:  A151571 A151572 A151573 * A151575 A151576 A151577

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 17 18:47 EST 2018. Contains 299296 sequences. (Running on oeis4.)