OFFSET
0,3
COMMENTS
This cellular automaton uses toothpicks of length 1 and D-toothpicks of length 2^(1/2). Toothpicks are placed in horizontal or vertical direction. D-toothpicks are placed in diagonal direction. Toothpicks and D-toothpicks are connected by their endpoints.
On the semi-infinite square grid we start with no elements, so a(0) = 0. At stage 1, we place a single toothpick in vertical direction at (0,0),(0,1), so a(1) = 1. Note that there is only one exposed toothpick endpoint.
The rules for adding new elements are 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. The endpoints of the toothpicks of the old generation that are perpendiculars to the initial toothpick remain exposed forever. Overlapping is prohibited.
The sequence gives the number of toothpicks and D-toothpicks in the structure after n-th stage. A220495 (the first differences) give the number of toothpicks or D-toothpicks added at n-th stage.
It appears that the structure has fractal behavior related to powers of 2. It appears that this cellular automaton has a surprising connection with the Sierpinski triangle, but here the structure is more complex.
LINKS
CROSSREFS
KEYWORD
nonn
AUTHOR
Omar E. Pol, Dec 23 2012
STATUS
approved