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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A170847 G.f.: Product_{k>=0} (1 + 3x^(2^k-1) + 2x^(2^k)). 0

%I #8 Feb 24 2021 02:48:19

%S 4,14,14,16,50,70,40,20,50,70,76,182,310,260,104,28,50,70,76,182,310,

%T 260,140,190,310,368,698,1294,1400,832,256,44,50,70,76,182,310,260,

%U 140,190,310,368,698,1294,1400,832,292,206,310,368,698,1294,1400,940,850,1310,1724

%N G.f.: Product_{k>=0} (1 + 3x^(2^k-1) + 2x^(2^k)).

%H David Applegate, Omar E. Pol and N. J. A. Sloane, <a href="/A000695/a000695_1.pdf">The Toothpick Sequence and Other Sequences from Cellular Automata</a>, 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.]

%H N. J. A. Sloane, <a href="/wiki/Catalog_of_Toothpick_and_CA_Sequences_in_OEIS">Catalog of Toothpick and Cellular Automata Sequences in the OEIS</a>

%K nonn

%O 0,1

%A _N. J. A. Sloane_, Jan 02 2010

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 February 29 03:50 EST 2024. Contains 370401 sequences. (Running on oeis4.)