TOPICS
Search

Toothpick Sequence


The toothpick sequence counts the total number T(n) of line segments after n stages of the following growth process. Stage 0 is empty, and stage 1 consists of one vertical unit line segment. An endpoint is exposed when it is neither an endpoint nor a midpoint of any other line segment. At each subsequent stage, a new unit line segment is centered at every exposed endpoint, perpendicular to the existing line segment there. All additions in a stage are made simultaneously (Applegate et al. 2010).

Starting with T(0)=0, the totals are 0, 1, 3, 7, 11, 15, 23, 35, 43, 47, ... (OEIS A139250). The numbers added at each stage are a(n)=T(n)-T(n-1) for n>=1, with a(0)=0. These begin 0, 1, 2, 4, 4, 4, 8, 12, 8, 4, ... (OEIS A139251). They satisfy

 a(2^k)=2^k

for nonnegative integers k and

 a(2^k+i)=2a(i)+a(i+1)

for integers i with 1<=i<2^k (Applegate et al. 2010). The cumulative totals are recovered as T(n)=sum_(j=0)^(n)a(j). This local growth rule provides a geometric example related to cellular automata (Applegate et al. 2010, Numberphile 2018).


See also

Cellular Automaton, Recurrence Equation

Explore with Wolfram|Alpha

References

Applegate, D.; Pol, O. E.; and Sloane, N. J. A. "The Toothpick Sequence and Other Sequences from Cellular Automata." Congr. Numer. 206, 157-191, 2010. https://arxiv.org/abs/1004.3036.Numberphile. "Terrific Toothpick Patterns." Dec. 10, 2018. https://www.youtube.com/watch?v=_UtCli1SgjI.Sloane, N. J. A. Sequences A139250 and A139251 in in "The On-Line Encyclopedia of Integer Sequences."

Cite this as:

Weisstein, Eric W. "Toothpick Sequence." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/ToothpickSequence.html

Subject classifications