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 A170905 #24 Feb 24 2021 02:48:19 %S A170905 0,1,2,2,4,2,4,6,8,2,4,6,10,10,8,14,16,2,4,6,10,10,10,18,26,18,8,14, %T A170905 24,28,20,32,32,2,4,6,10,10,10,18,26,18,10,18,30,38,34,42,58,34,8,14, %U A170905 24,28,28,44,68,60,28,32,56,70,50,70,64,2,4,6,10,10,10,18,26,18,10,18,30,38,34,42 %N A170905 Consider the hexagonal cellular automaton defined in A151723, A151724; a(n) = number of cells that go from OFF to ON at stage n, if we only look at a 60-degree wedge (including the two bounding edges). %H A170905 N. J. A. Sloane, <a href="/A170905/b170905.txt">Table of n, a(n) for n = 0..1025</a> %H A170905 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 A170905 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> %F A170905 a(n) = A170898(n-2) + 1 for n >= 2. %F A170905 a(n) = 2*A169778(n) for n != 1. %e A170905 From _Omar E. Pol_, Feb 12 2013: (Start) %e A170905 When written as a triangle starting from 1, the right border gives A000079 and row lengths give A011782. %e A170905 1; %e A170905 2; %e A170905 2,4; %e A170905 2,4,6,8; %e A170905 2,4,6,10,10,8,14,16; %e A170905 2,4,6,10,10,10,18,26,18,8,14,24,28,20,32,32; %e A170905 2,4,6,10,10,10,18,26,18,10,18,30,38,34,42,58,34,8,14,24,28,28,44,68,60,28,32,56,70,50,70,64; %e A170905 2,4,6,10,10,10,18,26,18,10,18,30,38,34,42,... %e A170905 ... (End) %Y A170905 Cf. A151723, A151724, A170898, A169778, A169780 (partial sums). %K A170905 nonn,tabf %O A170905 0,3 %A A170905 _N. J. A. Sloane_, Jan 22 2010