A371931 Center column of elementary triangular automaton rule 62, from a lone 1 cell.

1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 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.

Behavior of rule 62 (111110 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 |0|0|1|1|1|1|1|0|

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

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 62

Paul Cousin, Triangular Automata Mathematica Package

Crossrefs

Cf. A371844.

Sequence in context: A014282 A014555 A188017 * A286755 A286349 A145575

Adjacent sequences: A371928 A371929 A371930 * A371932 A371934 A371935

Keyword

nonn

Author

Paul Cousin, Apr 13 2024

Status

approved