Seqüència d'escuradents

geometric fractal-like pattern

Uses your system voice; voice and rate in settings.

The name shown is in ca. The article below is in English and is not a translation.

≈ 3 min read

Cite, export and learn8 citation formats · 8 exports · lesson and quiz

Names in other languages

  • ItalianoSequenza degli stuzzicadenti
  • EspañolSecuencia de mondadientes
  • caSeqüència d'escuradentsSeqüència dels escuradents
  • EnglishToothpick sequence

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

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 resembles 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]

References

edit edit source
  1. ^ a b c 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. Wikipedia revision 1369181527, retrieved 2026-11-21
  2. ^ Cipra, Barry A. (2010). "What Comes Next?". Science. 327 (5968). AAAS: 943. doi:10.1126/science.327.5968.943. PMID 20167763. Wikipedia revision 1369181527, retrieved 2026-11-21
  3. ^ Sloane, N. J. A. (ed.). "Sequence A139250 (Toothpick sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Wikipedia revision 1369181527, retrieved 2026-11-21
edit edit source

Text derived from https://en.wikipedia.org/w/index.php?oldid=1369181527 under CC BY-SA 4.0; modifications have been made.

Provenance

snapshot toothpick-sequence-634531-e88eea1f514a15ed · hash e88eea1f514a15ed2cb0422d100291a003735c6af3791d37dac6db59f9dbe186 · captured 2026-08-13 · ledger · version history

Cite this page as: encyclopegia.org, “Seqüència d'escuradents”, snapshot toothpick-sequence-634531-e88eea1f514a15ed. https://encyclopegia.org/a/toothpick-sequence