OFFSET
0,2
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 90 (1011010 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|1|0|1|1|0|1|0|
-----------------------------------------------
This is one of the 4 ETA rules (85, 90, 165 and 170) that replicates the pattern given as initial condition.
LINKS
Paul Cousin, Table of n, a(n) for n = 0..16384
Paul Cousin, Illustration for n = 0..128
Paul Cousin, Triangular Automata
Paul Cousin, Rule 90
Paul Cousin, Triangular Automata Integer Sequences
Paul Cousin, Triangular Automata: The 256 Elementary Cellular Automata of the Two-Dimensional Plane, Complex Systems, 33(3), 2024, pp. 253-276.
EXAMPLE
CROSSREFS
KEYWORD
nonn
AUTHOR
Paul Cousin, Apr 24 2025
STATUS
approved
