The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A170865 a(0) = 1, a(1) = 1; a(2^i + j) = a(j) + 3a(j + 1) for 0 <= j < 2^i. 0
 1, 1, 4, 13, 4, 13, 43, 25, 4, 13, 43, 25, 43, 142, 118, 37, 4, 13, 43, 25, 43, 142, 118, 37, 43, 142, 118, 154, 469, 496, 229, 49, 4, 13, 43, 25, 43, 142, 118, 37, 43, 142, 118, 154, 469, 496, 229, 49, 43, 142, 118, 154, 469, 496, 229, 166, 469, 496, 580, 1561, 1957, 1183 (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: A212256 A265327 A130650 * A320030 A191509 A218356 Adjacent sequences: A170862 A170863 A170864 * A170866 A170867 A170868 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 5 05:37 EST 2023. Contains 367575 sequences. (Running on oeis4.)