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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A151705 a(0)=0, a(1)=1; a(2^i+j) = 2*a(j) + 2*a(j+1) for 0 <= j < 2^i. 16
0, 1, 2, 6, 2, 6, 16, 16, 2, 6, 16, 16, 16, 44, 64, 36, 2, 6, 16, 16, 16, 44, 64, 36, 16, 44, 64, 64, 120, 216, 200, 76, 2, 6, 16, 16, 16, 44, 64, 36, 16, 44, 64, 64, 120, 216, 200, 76, 16, 44, 64, 64, 120, 216, 200, 104, 120, 216, 256, 368, 672, 832, 552, 156, 2, 6, 16, 16, 16 (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

MAPLE

See A151702 for Maple code.

MATHEMATICA

a = {0, 1}; Do[AppendTo[a, 2 a[[j]] + 2 a[[j + 1]]], {i, 6}, {j, 2^i}]; a (* Ivan Neretin, Jul 04 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: A163904 A152780 A241040 * A170861 A229578 A078992

Adjacent sequences:  A151702 A151703 A151704 * A151706 A151707 A151708

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, Jun 06 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 20:29 EST 2018. Contains 299296 sequences. (Running on oeis4.)