A160164 -id:A160164 - cp's OEIS frontend

A255366 Total number of ON cells at stage n of two-dimensional cellular automaton defined by the rules of the "Ulam-Warburton" two-dimensional cellular automaton (A147562) for two of its wedges and defined by "Rule 750" using the von Neumann neighborhood (A169707) for the two other wedges.

1, 5, 9, 21, 25, 37, 53, 85, 89, 101, 117, 149, 165, 205, 257, 341, 345, 357, 373, 405, 421, 461, 513, 597, 613, 653, 705, 797, 857, 989, 1141, 1365, 1369, 1381, 1397, 1429, 1445, 1485, 1537, 1621, 1637, 1677, 1729, 1821, 1881, 2013, 2165, 2389, 2405, 2445, 2497

Offset: 1

Omar E. Pol, Feb 21 2015

First differs from A162795 at a(14), but it appears that then they share infinitely many terms. It appears that this is very close to A162795 rather than both A147562 and A169707.
The graphs of both A162795 and this sequence are intertwined.
Note that there are four main versions of this cellular automaton, depending on whether the wedges with the same rule are opposite or perpendicular and also depending on whether each mentioned version is represented by the "one-step rook" illustration or by the "one-step bishop" illustration. The four versions are represented by this sequence.
a(43) = 1729 is also the Hardy-Ramanujan number.

			a(43) = (1705 + 1753)/2 = 3458/2 = 1729.

Cf. A001235, A048645, A139250, A147562, A160164, A162795, A169707.

a(n) = (A147562(n) + A169707(n))/2.

It appears that a(n) = A147562(n) = A162795(n) = A169709(n), if n is a member of A048645, or in other words: if the binary weight of n is 1 or 2, but note that a(n) = A162795(n) for many other values of n.

A170903 a(n) = 2*A160552(n)-1.

Original entry on oeis.org

1, 1, 5, 1, 5, 9, 13, 1, 5, 9, 13, 9, 21, 33, 29, 1, 5, 9, 13, 9, 21, 33, 29, 9, 21, 33, 37, 41, 77, 97, 61, 1, 5, 9, 13, 9, 21, 33, 29, 9, 21, 33, 37, 41, 77, 97, 61, 9, 21, 33, 37, 41, 77, 97, 69, 41, 77, 105, 117, 161, 253, 257, 125, 1, 5, 9, 13, 9, 21, 33, 29, 9, 21, 33, 37, 41, 77

Offset: 1

Gary W. Adamson, Jan 21 2010

nonn

			When written as a triangle:
1
1, 5;
1, 5, 9, 13;
1, 5, 9, 13, 9, 21, 33, 29;
...
Rows sums are A006516 (this is immediate from the definition).
From _Omar E. Pol_, Feb 17 2015: (Start)
Also, written as an irregular triangle in which the row lengths are the terms of A011782:
1;
1;
5,1;
5,9,13,1;
5,9,13,9,21,33,29,1;
5,9,13,9,21,33,29,9,21,33,37,41,77,97,61,1;
5,9,13,9,21,33,29,9,21,33,37,41,77,97,61,9,21,33,37,41,77,97,69,41,77,105,117,161,253,257,125,1;
Row sums give 1 together with the positive terms of A006516.
It appears that the right border (A000012) gives the smallest difference between A160164 and A169707 in every period.
(End)

David Applegate, Omar E. Pol and N. J. A. Sloane, The Toothpick Sequence and Other Sequences from Cellular Automata, Congressus Numerantium, Vol. 206 (2010), 157-191. [There is a typo in Theorem 6: (13) should read u(n) = 4.3^(wt(n-1)-1) for n >= 2.]
N. J. A. Sloane, Catalog of Toothpick and Cellular Automata Sequences in the OEIS

Cf. A006516, A139250, A139251, A160164, A160552, A169707.

It appears that a(n) = A160164(n) - A169707(n). - Omar E. Pol, Feb 17 2015

A327330 "Concave pentagon" toothpick sequence (see Comments for precise definition).

Original entry on oeis.org

0, 1, 3, 7, 11, 15, 23, 33, 41, 45, 53, 63, 75, 89, 111, 133, 149, 153, 161, 171, 183, 197, 219, 241, 261, 275, 299, 327, 361, 403, 463, 511, 547, 551, 559, 569, 581, 595, 617, 639, 659, 673, 697, 725, 759, 801, 861, 909, 949, 967, 995, 1029, 1075, 1125, 1183, 1233, 1281, 1321, 1389, 1465, 1549, 1657

Offset: 0

Omar E. Pol, Sep 01 2019

nonn

This arises from a hybrid cellular automaton on a triangular grid formed of I-toothpicks (A160164) and V-toothpicks (A161206).
The surprising fact is that after 2^k stages the structure looks like a concave pentagon, which is formed essentially by an equilateral triangle (E) surrounded by two quadrilaterals (Q1 and Q2), both with their largest sides in vertical position, as shown below:
.
                  *                 *
                  *  *           *  *
                  *     *     *     *
                  *        *        *
                  *   Q1   *   Q2   *
                  *       * *       *
                  *      *   *      *
                  *     *     *     *
                  *    *       *    *
                  *   *    E    *   *
                  *  *           *  *
                  * *             * *
                  **               **
                  * * * * * * * * * *
.
Note that for n >> 1 both quadrilaterals look like right triangles.
Every polygon has a slight resemblance to Sierpinsky's triangle, but here the structure is much more complex.
For the construction of the sequence the rules are as follows:
On the infinite triangular grid at stage 0 there are no toothpicks, so a(0) = 0.
At stage 1 we place an I-toothpick formed of two single toothpicks in vertical position, so a(1) = 1.
For the next n generation we have that:
If n is even then at every free end of the structure we add a V-toothpick, formed of two single toothpicks, with its central vertex directed upward, like a gable roof.
If n is odd then we add I-toothpicks in vertical position (see the example).
a(n) gives the total number of I-toothpicks and V-toothpicks in the structure after the n-th stage.
A327331 (the first differences) gives the number of elements added at the n-th stage.
2*a(n) gives the total number of single toothpicks of length 1 after the n-th stage.
The structure contains many kinds of polygonal regions, for example: triangles, trapezes, parallelograms, regular hexagons, concave hexagons, concave decagons, concave 12-gons, concave 18-gons, concave 20-gons, and other polygons.
The structure is almost identical to the structure of A327332, but a little larger at the upper edge.
The behavior seems to suggest that this sequence can be calculated with a formula, in the same way as A139250, but that is only a conjecture.
The "word" of this cellular automaton is "ab". For more information about the word of cellular automata see A296612.
For another version, very similar, starting with a V-toothpick, see A327332, which it appears that shares infinitely many terms with this sequence.

			Illustration of initial terms:
.
               |      /|\     |/|\|
               |       |      | | |
                      / \     |/ \|
                              |   |
n   :  0       1       2        3
a(n):  0       1       3        7
After three generations there are five I-toothpicks and two V-toothpicks in the structure, so a(3) = 5 + 2 = 7 (note that in total there are 2*a(3) = 2*7 = 14 single toothpicks of length 1).

First differs from A231348 at a(11).
Cf. A047999, A139250 (normal toothpicks), A160164 (I-toothpicks), A160722 (a concave pentagon with triangular cells), A161206 (V-toothpicks), A296612, A323641, A323642, A327331 (first differences), A327332 (another version).
For other hybrid cellular automata, see A194270, A194700, A220500, A289840, A290220, A294020, A294962, A294980, A299770, A323646, A323650.

Conjecture: a(2^k) = A327332(2^k), k >= 0.

A327332 "Concave pentagon" toothpick sequence, starting with a V-toothpick (see Comments for precise definition).

Original entry on oeis.org

0, 1, 3, 7, 11, 15, 21, 33, 41, 45, 51, 63, 75, 85, 101, 133, 149, 153, 159, 171, 183, 193, 209, 241, 261, 273, 291, 327, 363, 389, 431, 515, 547, 551, 557, 569, 581, 591, 607, 639, 659, 671, 689, 725, 761, 787, 829, 913, 953, 969, 993, 1041, 1085, 1109, 1149, 1229, 1277, 1309, 1357, 1453, 1549, 1613

Offset: 0

Omar E. Pol, Sep 01 2019

nonn

Another version and very similar to A327330.
This arises from a hybrid cellular automaton on a triangular grid formed of V-toothpicks (A161206) and I-toothpicks (A160164).
After 2^k stages, the structure looks like a concave pentagon, which is formed essentially by an equilateral triangle (E) surrounded by two right triangles (R1 and R2) both with their hypotenuses in vertical position, as shown below:
.
                  *                 *
                  *  *           *  *
                  *     *     *     *
                  *        *        *
                  *  R1   * *   R2  *
                  *      *   *      *
                  *     *     *     *
                  *    *       *    *
                  *   *    E    *   *
                  *  *           *  *
                  * *             * *
                  **               **
                  * * * * * * * * * *
.
Every triangle has a slight resemblance to Sierpinsky's triangle, but here the structure is much more complex.
For the construction of the sequence the rules are as follows:
On the infinite triangular grid at stage 0 there are no toothpicks, so a(0) = 0.
At stage 1 we place an V-toothpick, formed of two single toothpicks, with its central vertice directed up, like a gable roof, so a(1) = 1.
For the next n generation we have that:
If n is even then at every free end of the structure we add a I-toothpick formed of two single toothpicks in vertical position.
If n is odd then at every free end of the structure we add a V-toothpick, formed of two single toothpicks, with its central vertex directed upward, like a gable roof (see the example).
a(n) gives the total number of V-toothpicks and I-toothpicks in the structure after the n-th stage.
A327333 (the first differences) gives the number of elements added at the n-th stage.
2*a(n) gives the total number of single toothpicks of length 1 after the n-th stage.
The structure contains many kinds of polygonal regions, for example: triangles, trapezes, parallelograms, regular hexagons, concave hexagons, concave decagons, concave 12-gons, concave 18-gons, concave 20-gons, and other polygons.
The structure is almost identical to the structure of A327330, but a little smaller.
The behavior seems to suggest that this sequence can be calculated with a formula, in the same way as A139250, but that is only a conjecture.
The "word" of this cellular automaton is "ab". For more information about the word of cellular automata see A296612.
It appears that A327330 shares infinitely many terms with this sequence.

			Illustration of initial terms:
.
.             /\     |/\|
.                    |  |
.
n:     0       1       2
a(n):  0       1       3
After two generations there are only one V-toothpick and two I-toothpicks in the structure, so a(2) = 1 + 2 = 3 (note that in total there are 2*a(2)= 2*3 = 6 single toothpicks of length 1).

Cf. A139250 (normal toothpicks), A160164 (I-toothpicks), A160722 (a concave pentagon with triangular cells), A161206 (V-toothpicks), A296612, A323641, A323642, A327333 (first differences), A327330 (another version).

For other hybrid cellular automata, see A194270, A194700, A220500, A289840, A290220, A294020, A294962, A294980, A299770, A323646, A323650.

Conjecture: a(2^k) = A327330(2^k), k >= 0.

A183004 Toothpick sequence on square grid with toothpicks connected by their endpoints.

Original entry on oeis.org

0, 1, 5, 11, 19, 27, 43, 65, 81, 89, 105, 129, 153, 185, 241, 303, 335, 343, 359, 383, 407, 439, 495, 559, 599, 631, 687, 759, 839, 959, 1135, 1293, 1357, 1365, 1381, 1405, 1429, 1461, 1517, 1581, 1621, 1653, 1709, 1781

Offset: 0

Omar E. Pol, Mar 27 2011

nonn

Rules:
- If n is odd then each new toothpick must lie in vertical direction.
- If n is even then each new toothpick must lie in horizontal direction.
- Each exposed endpoint of the toothpicks of the old generation must be touched by the endpoints of two toothpicks of new generation.
The sequence gives the number of toothpicks after n stages. A183005 (the first differences) gives the number added at the n-th stage.
The structure is very similar to the structure of A139250 but the mechanism for the connection of toothpicks is different.

David Applegate, Omar E. Pol and N. J. A. Sloane, The Toothpick Sequence and Other Sequences from Cellular Automata, Congressus Numerantium, Vol. 206 (2010), 157-191. [There is a typo in Theorem 6: (13) should read u(n) = 4.3^(wt(n-1)-1) for n >= 2.]
N. J. A. Sloane, Catalog of Toothpick and Cellular Automata Sequences in the OEIS

Cf. A139250, A160164, A182840, A183005.

We start at stage 0 with no toothpicks.
At stage 1, place a single toothpick of length 1 on a square grid, aligned with the y-axis, so a(1)=1. There are two exposed endpoints.
At stage 2, place 4 toothpicks in horizontal position: two new toothpicks touching each exposed endpoint, so a(2)=1+4=5. There are 4 exposed endpoints.
At stage 3, place 6 toothpicks in vertical position, so a(3)=5+6=11.
After 3 stages the toothpick structure has 2 squares and 4 exposed endpoints.

A255263 Differences between the total number of ON cells at stage n of two-dimensional cellular automaton defined by "Rule 750" using the von Neumann neighborhood and the total number of toothpicks in the toothpick structure A139250 that are parallel to the initial toothpick, after n odd rounds.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 4, 0, 4, 12, 20, 0, 0, 0, 4, 0, 4, 12, 20, 0, 4, 12, 20, 12, 36, 80, 68, 0, 0, 0, 4, 0, 4, 12, 20, 0, 4, 12, 20, 12, 36, 80, 68, 0, 4, 12, 20, 12, 36, 80, 68, 12, 36, 80, 84, 96, 208, 352, 196, 0, 0, 0, 4, 0, 4, 12, 20, 0, 4, 12, 20, 12, 36, 80, 68, 0, 4, 12, 20, 12, 36, 80, 68, 12, 36, 80

Offset: 1

Omar E. Pol, Feb 19 2015

It appears that the graph of A162795 lies between the graphs of A147562 and A169707.

It appears that a(n) = 0 if and only if n is a member of A048645.

			Written as an irregular triangle T(j,k), k>=1, in which the row lengths are the terms of A011782:
0;
0;
0,0;
0,0,4,0;
0,0,4,0,4,12,20,0;
0,0,4,0,4,12,20,0,4,12,20,12,36,80,68,0;
0,0,4,0,4,12,20,0,4,12,20,12,36,80,68,0,4,12,20,12,36,80,68,12,36,80,84,96,208,352,196,0;
...
It appears that if k is a power of 2 then T(j,k) = 0.

Cf. A011782, A048645, A139250, A160164, A162796, A169707, A147562, A255166, A255264.

a(n) = A169707(n) - A162795(n).

A187216 Q-toothpick sequence starting with two opposite Q-toothpicks centered at the same grid point.

Original entry on oeis.org

0, 2, 8, 16, 30, 52, 82, 104, 142, 196, 266, 288, 326, 380, 450, 504, 606, 756, 890, 912, 950, 1004, 1074, 1128, 1230, 1380, 1514, 1568, 1670, 1820, 1986, 2168, 2494, 2900, 3162, 3184, 3222, 3276, 3346, 3400, 3502, 3652, 3786, 3840, 3942, 4092, 4258, 4440

Offset: 0

Omar E. Pol, Mar 30 2011

nonn

The sequence gives the number of Q-toothpicks in the structure after n-th stage.
A187217 (the first differences) gives the number of Q-toothpicks added at n-th stage.
Note that in the Q-toothpick structure sometimes there is also an internal growth of Q-toothpicks.
For more information see A187210.

			On the infinite square grid at stage 0 we start with no Q-toothpicks.
At stage 1 we place two opposite Q-toothpicks centered at (0,0). One of the Q-toothpicks lies on the first quadrant with its endpoints at (0,1) and (1,0). The other Q-toothpick lies on the third quadrant with its endpoints at (0,-1) and (-1,0). So a(1) = 2. There are 4 exposed endpoints.
At stage 2 we place 6 Q-toothpicks, so a(2) = 2+6 = 8.
At stage 3 we place 8 Q-toothpicks, so a(3) = 8+8 = 16.
At stage 4 we place 14 Q-toothpicks, so a(4) = 16+14 = 30.
After 4 stages in the Q-toothpick structure there are 1 circle, 2 "heads" and 12 exposed endpoints.

Nathaniel Johnston, Table of n, a(n) for n = 0..200
Nathaniel Johnston, C program for computing terms
David Applegate, Omar E. Pol and N. J. A. Sloane, The Toothpick Sequence and Other Sequences from Cellular Automata, Congressus Numerantium, Vol. 206 (2010), 157-191. [There is a typo in Theorem 6: (13) should read u(n) = 4.3^(wt(n-1)-1) for n >= 2.]
Nathaniel Johnston, The Q-Toothpick Cellular Automaton
N. J. A. Sloane, Catalog of Toothpick and Cellular Automata Sequences in the OEIS

Cf. A139250, A160120, A160164, A187210, A187212, A187217, A187220.

a(15) - a(47) from Nathaniel Johnston, Apr 15 2011

A255049 a(n) = 2*A160552(n).

Original entry on oeis.org

0, 2, 2, 6, 2, 6, 10, 14, 2, 6, 10, 14, 10, 22, 34, 30, 2, 6, 10, 14, 10, 22, 34, 30, 10, 22, 34, 38, 42, 78, 98, 62, 2, 6, 10, 14, 10, 22, 34, 30, 10, 22, 34, 38, 42, 78, 98, 62, 10, 22, 34, 38, 42, 78, 98, 70, 42, 78, 106, 118, 162, 254, 258, 126, 2, 6, 10, 14, 10

Offset: 0

Omar E. Pol, Feb 13 2015

			Written as an irregular triangle in which row lengths are the terms of A011782 the sequence begins:
0;
2;
2,6;
2,6,10,14;
2,6,10,14,10,22,34,30;
2,6,10,14,10,22,34,30,10,22,34,38,42,78,98,62;
2,6,10,14,10,22,34,30,10,22,34,38,42,78,98,62,10,22,34,38,42,78,98,70,42,78,106,118,162,254,258,126;
It appears that row sums give 0 together with A004171, (see also A081294).
It appears that right border gives the nonnegative terms of A000918, (see also A095121).

Cf. A000918, A004171, A081294, A095121, A139250, A160164, A160552, A169707, A169708, A187220.

It appears that a(n) = A169708(n)/2, n >= 1.

Edited by Omar E. Pol, Feb 18 2015

cp's OEIS Frontend

A255366 Total number of ON cells at stage n of two-dimensional cellular automaton defined by the rules of the "Ulam-Warburton" two-dimensional cellular automaton (A147562) for two of its wedges and defined by "Rule 750" using the von Neumann neighborhood (A169707) for the two other wedges.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

A170903 a(n) = 2*A160552(n)-1.

Views

Author

Keywords

Examples

Links

Crossrefs

Formula

A327330 "Concave pentagon" toothpick sequence (see Comments for precise definition).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

A327332 "Concave pentagon" toothpick sequence, starting with a V-toothpick (see Comments for precise definition).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

A183004 Toothpick sequence on square grid with toothpicks connected by their endpoints.

Views

Author

Keywords

Comments

Links

Crossrefs

Formula

A255263 Differences between the total number of ON cells at stage n of two-dimensional cellular automaton defined by "Rule 750" using the von Neumann neighborhood and the total number of toothpicks in the toothpick structure A139250 that are parallel to the initial toothpick, after n odd rounds.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

A187216 Q-toothpick sequence starting with two opposite Q-toothpicks centered at the same grid point.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Extensions

A255049 a(n) = 2*A160552(n).

Views

Author

Keywords

Examples

Links

Crossrefs

Formula

Extensions