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 A170887 #26 Feb 24 2021 02:48:19 %S A170887 0,1,2,2,2,4,6,6,6,8,12,6,8,12,18,14,14,20,20,6,8,12,18,14,16,24,26, %T A170887 16,24,38,46,38,42,52,36,6,8,12,18,14,16,24,26,16,24,38,46,38,44,56, %U A170887 42,16,24,38,46,40,52,70,64,52,82,118,126,114,130,132,68,6,8,12,18,14,16,24 %N A170887 First differences of toothpick sequence A170886. %C A170887 Number of toothpicks added at n-th stage to the toothpick structure of A170886. - _Omar E. Pol_, Jan 31 2013 %H A170887 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 A170887 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> %e A170887 From _Omar E. Pol_, Jan 30 2013: (Start) %e A170887 If written as an irregular triangle in which rows 0..3 have length 1, it appears that row j has length 2^(j-4), if j >= 4. - _Omar E. Pol_, Jan 31 2013 %e A170887 0; %e A170887 1; %e A170887 2; %e A170887 2; %e A170887 2; %e A170887 4,6; %e A170887 6,6,8,12; %e A170887 6,8,12,18,14,14,20,20; %e A170887 6,8,12,18,14,16,24,26,16,24,38,46,38,42,52,36; %e A170887 6,8,12,18,14,16,24,26,16,24,38,46,38,44,56,42,16,24,38,46,40,52,70,64,52,82,118,126,114,130,132,68; %e A170887 6,8,12,18,14,16,24,... %e A170887 (End) %Y A170887 Cf. A139250, A139251, A160407, A170886, A170889, A170891, A170893. %K A170887 nonn,tabf %O A170887 0,3 %A A170887 _Omar E. Pol_, Jan 09 2010 %E A170887 More terms from _R. J. Mathar_, Jan 25 2010