A374413 Second center column of elementary triangular automaton rule 210, from a lone 1 cell.

0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0

Offset

0

Comments

An Elementary Triangular Automaton (ETA) is a cellular automaton in the triangular grid where cells hold binary states and rules are local to the first neighborhood. There are 256 possible ETA rules.

Rule 210 (11010010 in binary):

-----------------------------------------------

|state of the cell |1|1|1|1|0|0|0|0|

|sum of the neighbors' states |3|2|1|0|3|2|1|0|

|cell's next state |1|1|0|1|0|0|1|0|

-----------------------------------------------

Rule 210 is easy to describe: "change the state of cells that have one 1 neighbor".

The second center column is the sequence of states of the direct neighbors of the initial 1 cell.

References

Paul Cousin, "Triangular Automata: The 256 Elementary Cellular Automata of the 2D Plane", Complex Systems, 33(2), 2024.

Links

Paul Cousin, Table of n, a(n) for n = 0..4096

Paul Cousin, Triangular Automata: The 256 Elementary Cellular Automata of the 2D Plane, arXiv:2309.15795 [nlin.CG], 2023.

Paul Cousin, Triangular Automata.

Paul Cousin, Rule 210.

Paul Cousin, Rule 210 video.

Paul Cousin, Triangular Automata Mathematica Package.

Crossrefs

Cf. A372581, A374769.

Sequence in context: A117943 A285969 A189664 * A260446 A096268 A219097

Adjacent sequences: A374410 A374411 A374412 * A374414 A374415 A374416

Keyword

nonn

Author

Paul Cousin, Jul 08 2024

Status

approved