Toothpick sequence

Last updated
The first three steps of the toothpick sequence and its emulation by a cellular automaton with the Margolus neighborhood Margolus toothpick animated.gif
The first three steps of the toothpick sequence and its emulation by a cellular automaton with the Margolus neighborhood
The 89th stage of the sequence, one of the stages at which T(n)/n is near its minimum Toothpick 89.svg
The 89th stage of the sequence, one of the stages at which T(n)/n is near its minimum

In geometry, the toothpick sequence is a sequence of 2-dimensional patterns which can be formed by repeatedly adding line segments ("toothpicks") to the previous pattern in the sequence.

The first stage of the design is a single "toothpick", or line segment. Each stage after the first is formed by taking the previous design and, for every exposed toothpick end, placing another toothpick centered at a right angle on that end. [1]

This process results in a pattern of growth in which the number of segments at stage n oscillates with a fractal pattern between 0.45n2 and 0.67n2. If T(n) denotes the number of segments at stage n, then values of n for which T(n)/n2 is near its maximum occur when n is near a power of two, while the values for which it is near its minimum occur near numbers that are approximately 1.43 times a power of two. [2] The structure of stages in the toothpick sequence often resemble the T-square fractal, or the arrangement of cells in the Ulam–Warburton cellular automaton. [1]

All of the bounded regions surrounded by toothpicks in the pattern, but not themselves crossed by toothpicks, must be squares or rectangles. [1] It has been conjectured that every open rectangle in the toothpick pattern (that is, a rectangle that is completely surrounded by toothpicks, but has no toothpick crossing its interior) has side lengths and areas that are powers of two, with one of the side lengths being at most two. [3]

Related Research Articles

21 (twenty-one) is the natural number following 20 and preceding 22.

111 is the natural number following 110 and preceding 112.

31 (thirty-one) is the natural number following 30 and preceding 32. It is a prime number.

64 (sixty-four) is the natural number following 63 and preceding 65.

68 (sixty-eight) is the natural number following 67 and preceding 69. It is an even number.

104 is the natural number following 103 and preceding 105.

1000 or one thousand is the natural number following 999 and preceding 1001. In most English-speaking countries, it can be written with or without a comma or sometimes a period separating the thousands digit: 1,000.

300 is the natural number following 299 and preceding 301.

600 is the natural number following 599 and preceding 601.

800 is the natural number following 799 and preceding 801.

900 is the natural number following 899 and preceding 901. It is the square of 30 and the sum of Euler's totient function for the first 54 positive integers. In base 10, it is a Harshad number. It is also the first number to be the square of a sphenic number.

185 is the natural number following 184 and preceding 186.

124 is the natural number following 123 and preceding 125.

<span class="mw-page-title-main">1,000,000</span> Natural number

1,000,000, or one thousand thousand, is the natural number following 999,999 and preceding 1,000,001. The word is derived from the early Italian millione, from mille, "thousand", plus the augmentative suffix -one.

225 is the natural number following 224 and preceding 226.

277 is the natural number following 276 and preceding 278.

288 is the natural number following 287 and preceding 289. Because 288 = 2 · 12 · 12, it may also be called "two gross" or "two dozen dozen".

30,000 is the natural number that comes after 29,999 and before 30,001.

888 is the natural number following 887 and preceding 889.

<span class="mw-page-title-main">Ulam–Warburton automaton</span>

The Ulam–Warburton cellular automaton (UWCA) is a 2-dimensional fractal pattern that grows on a regular grid of cells consisting of squares. Starting with one square initially ON and all others OFF, successive iterations are generated by turning ON all squares that share precisely one edge with an ON square. This is the von Neumann neighborhood. The automaton is named after the Polish-American mathematician and scientist Stanislaw Ulam and the Scottish engineer, inventor and amateur mathematician Mike Warburton.

References

  1. 1 2 3 Applegate, David; Pol, Omar E.; Sloane, N. J. A. (2010). "The toothpick sequence and other sequences from cellular automata". Proceedings of the Forty-First Southeastern International Conference on Combinatorics, Graph Theory and Computing. Congressus Numerantium. Vol. 206. pp. 157–191. arXiv: 1004.3036 . Bibcode:2010arXiv1004.3036A. MR   2762248.
  2. ↑ Cipra, Barry A. (2010). "What Comes Next?". Science. 327 (5968). AAAS: 943. doi:10.1126/science.327.5968.943. PMID   20167763.
  3. ↑ Sloane, N. J. A. (ed.). "SequenceA139250(Toothpick sequence)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.