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

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A170858 a(0) = 1, a(1) = 0; a(2^i + j) = 3a(j) + a(j + 1) for 0 <= j < 2^i. 0
1, 0, 3, 3, 3, 3, 12, 12, 3, 3, 12, 12, 12, 21, 48, 39, 3, 3, 12, 12, 12, 21, 48, 39, 12, 21, 48, 48, 57, 111, 183, 120, 3, 3, 12, 12, 12, 21, 48, 39, 12, 21, 48, 48, 57, 111, 183, 120, 12, 21, 48, 48, 57, 111, 183, 129, 57, 111, 192, 201, 282, 516, 669, 363, 3, 3, 12, 12, 12, 21 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

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

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: A087575 A001270 A029630 * A024725 A269562 A214730

Adjacent sequences:  A170855 A170856 A170857 * A170859 A170860 A170861

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 14 14:20 EST 2019. Contains 329979 sequences. (Running on oeis4.)