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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A151570 a(0)=1, a(1)=1; a(2^i+j)=a(j)+a(j+1) for 0 <= j < 2^i. 16
1, 1, 2, 3, 2, 3, 5, 5, 2, 3, 5, 5, 5, 8, 10, 7, 2, 3, 5, 5, 5, 8, 10, 7, 5, 8, 10, 10, 13, 18, 17, 9, 2, 3, 5, 5, 5, 8, 10, 7, 5, 8, 10, 10, 13, 18, 17, 9, 5, 8, 10, 10, 13, 18, 17, 12, 13, 18, 20, 23, 31, 35, 26, 11, 2, 3, 5, 5, 5, 8, 10, 7, 5, 8, 10, 10, 13, 18, 17, 9, 5, 8, 10, 10, 13, 18, 17, 12 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

COMMENTS

Equals A118977 + A151702.

LINKS

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

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

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: A046147 A052369 A110976 * A059036 A184442 A163466

Adjacent sequences:  A151567 A151568 A151569 * A151571 A151572 A151573

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 | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified May 25 11:35 EDT 2013. Contains 225647 sequences.