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 A182836 #11 Feb 24 2021 02:48:19 %S A182836 0,1,3,7,15,27,39,51,71,91,107 %N A182836 Toothpick sequence starting at the vertex of the outside corner of an infinite 120-degree wedge on hexagonal net. %C A182836 Corner sequence for the toothpick structure on hexagonal net. %C A182836 The sequence gives the number of toothpicks after n stages. A182837 (the first differences) gives the number added at the n-th stage. For more information see A182632 and A153006. %H A182836 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 A182836 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 A182836 <a href="/index/To#toothpick">Index entries for sequences related to toothpick sequences</a> %e A182836 We start at stage 0 with no toothpicks. %e A182836 At stage 1 we place a single toothpick touching a vertex of the infinite hexagon, in direction to the center of the hexagon, but on the outside corner, so a(1)=1. %e A182836 At stage 2 we place 2 toothpicks touching the exposed endpoint of the initial toothpick, so a(2)=1+2=3. %e A182836 At stage 3 we place 4 toothpicks, so a(3)=3+4=7. %e A182836 At stage 4 we place 8 toothpicks, so a(4)=7+8=15. %e A182836 At stage 5 we place 12 toothpicks, so a(5)=15+12=27. %e A182836 After 5 stages the toothpick structure has 5 hexagons and 6 exposed endpoints. %Y A182836 Cf. A139250, A153006, A182632, A182634, A182837, A182840. %K A182836 nonn,more %O A182836 0,3 %A A182836 _Omar E. Pol_, Dec 12 2010