login
A371844
Center column of elementary triangular automaton rule 37, from a lone 1 cell.
4
1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 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.
Rule 37 (100101 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|0|0|1|0|1|
-----------------------------------------------
REFERENCES
Paul Cousin, "Triangular Automata: The 256 Elementary Cellular Automata of the 2D Plane", Complex Systems, 33(2), 2024.
CROSSREFS
KEYWORD
nonn
AUTHOR
Paul Cousin, Apr 08 2024
STATUS
approved