This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A266532 #45 Apr 02 2016 21:24:39 %S A266532 0,1,4,7,16,19,28,37,58,61,70,79,100,109,130,151,196,199,208,217,238, %T A266532 247,268,289,334,343,364,385,430,451,496,541,634,637,646,655,676,685, %U A266532 706,727,772,781,802,823,868,889,934,979,1072,1081,1102,1123,1168,1189,1234,1279,1372,1393,1438,1483,1576,1621,1714,1807,1996,1999,2008,2017 %N A266532 Total number of Y-toothpicks after n-th stage in the "outward" version of the cellular automaton of A160120. %C A266532 For the connection with A160720 (the "outward" version of the Ulam-Warburton cellular automaton A147562) see formula section and A267700. %C A266532 A266533 (the first differences) gives the number of Y-toothpicks added to the structure at n-th stage. %C A266532 First differs from A160120 at a(9). %C A266532 First differs from A160715 at a(13). %H A266532 David Applegate, <a href="/A139250/a139250.anim.html">The movie version</a> %H A266532 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> %H A266532 <a href="/index/Ce#cell">Index entries for sequences related to cellular automata</a> %H A266532 <a href="/index/To#toothpick">Index entries for sequences related to toothpick sequences</a> %F A266532 Conjecture: a(n) = 1 + 3*(A160720(n) - 1)/4 = 1 + 3*A267700(n-1), n >= 1. This formula is correct! - _N. J. A. Sloane_, Jan 23 2016 %F A266532 a(n) = 1 + 3*(A159912(n) - n)/2, n >= 1. - _Omar E. Pol_, Jan 24 2016 %Y A266532 Cf. A139250, A147562, A159912, A160120, A160715, A160720, A266533, A267700, A267701. %K A266532 nonn %O A266532 0,3 %A A266532 _David Applegate_ and _Omar E. Pol_, Jan 18 2016