

A220500


Dtoothpick sequence of the third kind starting with a single toothpick.


26



0, 1, 5, 13, 29, 51, 75, 99, 135, 175, 207, 251, 315, 409, 481, 537, 613, 685, 717, 765, 845, 957, 1097, 1237, 1377, 1545, 1665, 1797, 1965, 2203, 2371, 2491, 2647, 2783, 2815, 2863, 2943, 3055, 3195, 3339, 3503, 3727, 3943, 4199, 4471, 4839, 5163, 5479, 5759, 6055, 6215, 6365, 6597, 6917, 7321, 7753, 8161
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,3


COMMENTS

This is a cellular automaton of forking paths to 135 degrees which uses elements of three sizes: toothpicks of length 1, Dtoothpicks of length 2^(1/2) and Dtoothpicks of length 2^(1/2)/2. Toothpicks are placed in horizontal or vertical direction. Dtoothpicks are placed in diagonal direction. Toothpicks and Dtoothpicks are connected by their endpoints.
On the infinite square grid we start with no elements.
At stage 1, place a single toothpick on the paper, aligned with the yaxis. The rule for adding new elements is as follows. Each exposed endpoint of the elements of the old generation must be touched by the two endpoints of two elements of the new generation such that the angle between the old element and each new element is equal to 135 degrees. Intersections and overlapping are prohibited.
The sequence gives the number of toothpicks and Dtoothpicks in the structure after nth stage. The first differences (A220501) give the number of toothpicks or Dtoothpicks added at nth stage.
It appears that if n >> 1 the structure looks like an octagon. This C.A. has a fractal (or likefractal) behavior related to powers of 2. Note that for some values of n we can see an internal growth.
The structure contains eight wedges. Each vertical wedge (see A220520) also contains infinitely many copies of the oblique wedges. Each oblique wedge (see A220522) also contains infinitely many copies of the vertical wedges. Finally, each horizontal wedge also contains infinitely many copies of the vertical wedges and of the oblique wedges.
The structure is mysterious: it contains at least 59 distinct internal regions (or polygonal pieces), for example: one of the concave octagons appears for first time at stage 223. The largest known polygon is a concave 24gon. The exact number of distinct polygons is unknown.
Also the structure contains infinitely many copies of two subsets of distinct size which are formed by five polygons: three hexagons, a 9gon and a pentagon. These subsets have a surprising connection with the Sierpinski triangle A047999, but the pattern is more complex.
Apparently this cellular automaton has the most complex structure of all the toothpick structures that have been studied (see illustrationsm also the illustrations of the wedges in the entries A220520 and A220522).
The structure contains at least 69 distinct polygonal pieces. The largest known polygon is a concave 24gon of area 95/2 = 47.5 which appears for first time at stage 879.  Omar E. Pol, Feb 10 2018


LINKS

Table of n, a(n) for n=0..56.
David Applegate, The movie version
Leonid Broukhis, A program generating variations of the "Dtoothpick" pattern, Oct. 1995; (remarks)
Omar E. Pol, Illustration of initial terms
Omar E. Pol, Illustration of the structure after 17 stages
N. J. A. Sloane, Catalog of Toothpick and Cellular Automata Sequences in the OEIS
Index entries for sequences related to toothpick sequences


CROSSREFS

Cf. A139250, A172310, A194270, A194276, A194432, A194434, A194440, A194442, A194444, A194700, A220520, A220522.
Sequence in context: A212008 A194270 A194700 * A130230 A106931 A078370
Adjacent sequences: A220497 A220498 A220499 * A220501 A220502 A220503


KEYWORD

nonn


AUTHOR

Omar E. Pol, Dec 15 2012


EXTENSIONS

Terms a(23) and beyond from David Applegate's movie version.  Omar E. Pol, Feb 10 2018


STATUS

approved



