A173460 -id:A173460 - cp's OEIS frontend

A173461 Number of cells turned "ON" at n-th stage of cellular automaton of A173460.

0, 1, 8, 12, 8, 52, 12, 12, 84, 36, 28, 188, 12, 12, 84, 36, 36, 252, 36, 36, 252, 108, 92, 628, 12, 12, 84, 36, 36, 252, 36, 36, 252, 108, 108, 756, 36, 36, 252, 108, 108, 756, 108, 108, 756, 324, 292, 2012, 12, 12, 84, 36, 36, 252, 36, 36, 252, 108, 108

Offset: 0

Omar E. Pol, Feb 18 2010

Essentially the first differences of A173460.

It appears that row lengths give the absolute values of A110164. - Omar E. Pol, Apr 25 2013

			From _Omar E. Pol_, Apr 25 2013: (Start)
When written as an irregular triangle begins:
0;
1,8;
12,8,52;
12,12,84,36,28,188;
12,12,84,36,36,252,36,36,252,108,92,628;
12,12,84,36,36,252,36,36,252,108,108,756,36,36,252,108,108,756,108,108,756,324,292,2012;
12,12,84,36,36,252,36,36,252,108,108,...
(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. A139250, A139251, A173457, A173460, A173462, A173463.

a(0)=0, a(1)=1, a(2)=8, for n>=3 let i=n/3+1, j=A147610(i), if 2^r==i for some r then let c1=2^(r+1), c2=2^(r+4) else let c1=c2=0, finally when (n MOD 3)=0,1,2 let a(n)=12*j, 12*j-c1, 84*j-c2. (Found empirically) [Lars Blomberg, Apr 23 2013]

More terms a(14)-a(17) from Omar E. Pol, Sep 25 2011

a(18)-a(58) from Lars Blomberg, Apr 23 2013

A173456 Number of "ON" cells at n-th stage in simple 2-dimensional cellular automaton (see Comments for precise definition).

Original entry on oeis.org

0, 1, 9, 21, 25, 53, 89, 93, 121, 157, 169, 253, 361, 365, 393, 429, 441, 525, 633, 645, 729, 837, 873, 1125, 1449, 1453, 1481, 1517, 1529, 1613, 1721, 1733, 1817, 1925, 1961, 2213, 2537, 2549, 2633, 2741, 2777, 3029, 3353, 3389, 3641, 3965, 4073, 4829, 5801

Offset: 0

Omar E. Pol, Feb 18 2010

nonn

On the infinite square grid, we start at stage 0 with all cells in OFF state. At stage 1, we turn ON a single cell, in the central position.
In order to construct this sequence we use the following rules:
- If n is congruent to 0 (mod 3), we turn "ON" the cells around the vertex of every convex corner formed in the structure at the generation n-1. Note that every vertex is surrounded by three new "ON" cells.
- If n is congruent to 1 (mod 3), we turn "ON" the possible peninsula cells (For the definition of peninsula cell see A160117).
- If n is congruent to 2 (mod 3), we turn "ON" the cells around the cells turned "ON" at the generation n-1.
- Everything that is already ON remains ON.
A173457, the first differences, gives the number of cells turned "ON" at n-th stage.

			Array begins:
0, 1, 9;
21, 25, 53;
89, 93, 121;
157, 169, 253;
361, 365, 393;
...
If we label the generations of cells turned ON by consecutive numbers we get the cell pattern shown below:
7...........7
.66.66.66.66.
.65556.65556.
..545...545..
.65533.33556.
.66.32223.66.
.....212.....
.66.32223.66.
.65533.33556.
..545...545..
.65556.65556.
.66.66.66.66.
7...........7

Lars Blomberg, Table of n, a(n) for n = 0..5999
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. A160117, A160118, A173457, A173458, A173459, A173460.

a(0)=0, a(n)=a(n-1)+A173457(n), n>=1

a(41)-a(48) from Lars Blomberg, Apr 22 2013

A173462 a(n) = A173461(n+1)/2.

Original entry on oeis.org

4, 6, 4, 26, 6, 6, 42, 18, 14, 94, 6, 6, 42, 18, 18, 126, 18, 18, 126, 54, 46, 314, 6, 6, 42, 18, 18, 126, 18, 18, 126, 54, 54, 378, 18, 18, 126, 54, 54, 378, 54, 54, 378, 162, 146, 1006, 6, 6, 42, 18, 18, 126, 18, 18, 126, 54, 54

Offset: 1

Omar E. Pol, Feb 18 2010

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. A173458, A173460, A173461, A173463.

More terms from Jinyuan Wang, Mar 02 2020

A173463 a(n) = A173461(n+1)/4.

Original entry on oeis.org

2, 3, 2, 13, 3, 3, 21, 9, 7, 47, 3, 3, 21, 9, 9, 63, 9, 9, 63, 27, 23, 157, 3, 3, 21, 9, 9, 63, 9, 9, 63, 27, 27, 189, 9, 9, 63, 27, 27, 189, 27, 27, 189, 81, 73, 503, 3, 3, 21, 9, 9, 63, 9, 9, 63, 27, 27

Offset: 1

Omar E. Pol, Feb 18 2010

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. A173459, A173460, A173461, A173462.

More terms from Jinyuan Wang, Mar 02 2020

cp's OEIS Frontend

A173461 Number of cells turned "ON" at n-th stage of cellular automaton of A173460.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

Extensions

A173456 Number of "ON" cells at n-th stage in simple 2-dimensional cellular automaton (see Comments for precise definition).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

Extensions

A173462 a(n) = A173461(n+1)/2.

Views

Author

Keywords

Links

Crossrefs

Extensions

A173463 a(n) = A173461(n+1)/4.

Views

Author

Keywords

Links

Crossrefs

Extensions