cp's OEIS Frontend

Essentially the first differences of A194432.

This is a cellular automaton of forking paths to 135 degrees which uses elements of two sizes: 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 infinite square grid we start with no elements.

At stage 1, we place anywhere a D-toothpick.

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, so some toothpick endpoints can remain exposed forever.

The sequence gives the number of toothpicks and D-toothpicks in the structure after n-th stage. The first differences (A194271) give the number of toothpicks and D-toothpicks added at n-th stage.

If n >> 1 the structure looks like an almost regular octagon. The structure has a fractal-like behavior related to powers of 2 (see formula section in A194271 and A194443). Note that for some values of n we can see an internal growth, similar to A160120. Also there are hidden substructures which have a surprising connection with the Sierpinski triangle. The hidden substructures are displayed more clearly for large values of n without reducing the scale of the drawing. The main "wedges" in the structures are essentially the triangles A194440 and A194442.

Note that this structure is much more complex than A139250 and A160120. The structure contains a large number of distinct polygonal shapes. There are convex polygons and concave polygons, also there are symmetrical and asymmetrical polygons. Several of these polygons are also in the structure of A172310. The number of edges of the known polygons are 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 16, 17, 20, 24. Is not known how many distinct types of polygons there are in the structure if n -> infinite. The sequences related with these polygons are A194276, A194277, A194278 and A194283. Note that the structure is not centered with respect to the axes X, Y. Also, for some polygons the area is not an integer. For symmetric versions of C. A. see A194432 and A194434.

Another representation (Large version): instead toothpicks of length 1 we place toothpicks of length 2. We start with no toothpicks. At stage 1, we place a toothpick of length 2 on the y-axis and centered at the origin. At stage 2 we place four D-toothpicks of length 2^(1/2) = sqrt(2), and so on. In this case the structure is centered with respect to the axes X, Y and the area of the polygons is an integer.

[It appears that a normal toothpick is a line segment of length 1 that is parallel to the x-axis or the y-axis. A D-toothpick is a line segment of length sqrt(2) with slope +-1. D stands for diagonal. - N. J. A. Sloane, Feb 06 2023]

This is a cellular automaton of forking paths to 135 degrees which uses elements of three sizes: toothpicks of length 1, D-toothpicks of length 2^(1/2) and D-toothpicks of length 2^(1/2)/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 infinite square grid we start with no elements.

At stage 1, place a single toothpick on the paper, aligned with the y-axis. 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 D-toothpicks in the structure after n-th stage. The first differences (A220501) give the number of toothpicks or D-toothpicks added at n-th stage.

It appears that if n >> 1 the structure looks like an octagon. This C.A. has a fractal (or fractal-like) 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 24-gon. 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 9-gon 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 24-gon of area 95/2 = 47.5 which appears for first time at stage 879. - Omar E. Pol, Feb 10 2018

This cellular automaton has essentially the same rules as A194270. We start at stage 0 with no toothpicks. At stage 1, we place a D-toothpick of length sqrt(2), in diagonal direction, at (0,0),(1,1). At stage 2, we place two toothpicks of length 1. At stage 3 we place four D-toothpicks. And so on. The toothpicks and D-toothpicks are connected by their endpoints. The sequence gives the number of toothpicks and D-toothpicks in the structure after n-th stage. The first differences (A194445) give the number of toothpicks or D-toothpicks added at n-th stage. It appears that the structure shows a fractal (or fractal-like) behavior.

First differs from A220524 at a(13). - Omar E. Pol, Mar 23 2013

On the infinite square grid we start at stage 0 with no toothpicks. Toothpicks have length 2. At stage 1 we place two consecutive toothpicks in the vertical direction and two consecutive toothpicks in the horizontal direction forming a cross centered at the origin. At stage 2 we place four toothpicks. At stage 3 we place eight toothpicks. For more information about the toothpick sequences see A139250. - Omar E. Pol, Nov 24 2011

On the infinite square grid we start with no toothpicks.

At stage 1, we place a cross as a "X", formed by 4 D-toothpicks of length sqrt(2) and centered at the origin. At stage 2, we place 8 toothpicks of length 1. At stage 3, we place 16 D-toothpicks of length sqrt(2). And so on.

The sequence gives the number of toothpicks and D-toothpicks in the structure after n-th stage. The first differences (A194435) give the number of toothpicks or D-toothpicks added at n-th stage.

Apparently this cellular automaton has a fractal behavior (or fractal-like behavior) related to power of 2, similar to A194270 and very similar to A194432. The octagonal structure contains a large number of distinct closed polygonal regions. For more information see A194270, A194440 and A194442.

First differs from A220514 at a(13). - Omar E. Pol, Mar 23 2013

Observation: at least for the terms in the Data section the graph also appears to be a companion of the graph of A187210 but that could be different comparing more terms. - Omar E. Pol, Jun 24 2022

This cellular automaton uses elements of two sizes: 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 infinite square grid we start with no elements.

At stage 1, place a single toothpick on the paper, aligned with the y-axis.

The rule for adding new elements is as follows. If it is possible, 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, otherwise each exposed endpoint of the elements of the old generation must be touched by an endpoint of an element of the new generation such that the angle between the old element and the new element is equal to 135 degrees. Intersections and overlapping are prohibited. The sequence gives the number of toothpicks and D-toothpicks in the structure after n-th stage. The first differences (A212009) give the number of toothpicks or D-toothpicks added at n-th stage.

It appears that if n >> 1 the structure looks like an octagon. This C.A. has a fractal (or fractal-like) 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 also contains infinitely many copies of the oblique wedges. Each oblique wedge 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 appears to be a puzzle which contains at least 50 distinct internal regions (or polygonal pieces), and possibly more. Some of them appear for first time after 200 stages. The largest known polygon is a concave 24-gon.

Also the structure contains infinitely many copies of two subsets of distinct size which are formed by five polygons: three hexagons, a 9-gon and a pentagon. The distribution of these subsets have a surprising connection with the Sierpinski triangle A047999, but here the pattern is more complex.

For another version see A220500.

This is a toothpick sequence of forking paths to 135 degrees. The sequence gives the number of toothpicks and D-toothpicks in the structure after n-th stage. A221565 (the first differences) give the number of toothpicks or D-toothpicks added at n-th stage. It appears that the structure has a fractal (or fractal-like) behavior. For more information see A194700.

First differs from A194432 at a(14).