OFFSET
0,3
COMMENTS
Note that if n is odd then we add the small L-toothpicks to the structure, otherwise we add the large L-toothpicks to the structure.
We start at stage 0 with half L-toothpick: A segment from (0,0) to (1,1).
At stage 1 we place a small L-toothpick at the exposed toothpick end.
At stage 2 we place two large L-toothpicks.
At stage 3 we place two small L-toothpicks.
At stage 4 we place two large L-toothpicks.
And so on...
The sequence gives the number of L-toothpicks after n stages. A172309 (the first differences) gives the number of L-toothpicks added at the n-th stage.
LINKS
David Applegate, Omar E. Pol and N. J. A. Sloane, The Toothpick Sequence and Other Sequences from Cellular Automata, 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.]
N. J. A. Sloane, Catalog of Toothpick and Cellular Automata Sequences in the OEIS
CROSSREFS
KEYWORD
nonn
AUTHOR
Omar E. Pol, Feb 06 2010
EXTENSIONS
a(17)-a(47) from Robert Price, Jun 17 2019
STATUS
approved