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): "cells with one 1 neighbor change state"
-----------------------------------------------
|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|
-----------------------------------------------
The second center column is the sequence of states of the direct neighbors of the initial 1 cell.
LINKS
Paul Cousin, Table of n, a(n) for n = 0..16384
Paul Cousin, Triangular Automata
Paul Cousin, Rule 210
Paul Cousin, Triangular Automata: The 256 Elementary Cellular Automata of the Two-Dimensional Plane, Complex Systems, 33(3), 2024, pp. 253-276.
CROSSREFS
KEYWORD
nonn,changed
AUTHOR
Paul Cousin, Jul 08 2024
STATUS
approved