|
|
A372581
|
|
Population of elementary triangular automaton rule 210, from a lone 1 cell.
|
|
2
|
|
|
1, 4, 7, 13, 7, 28, 25, 46, 13, 46, 49, 85, 43, 115, 97, 178, 55, 136, 97, 202, 91, 268, 157, 343, 151, 376, 217, 439, 229, 580, 349, 643, 337, 595, 421, 631, 481, 793, 481, 781, 439, 877, 583, 997, 577, 1192, 787, 1297, 799, 1429, 805, 1438, 889, 1765, 991, 1822, 1039, 1969, 1267, 2200
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
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 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".
|
|
REFERENCES
|
Paul Cousin, "Triangular Automata: The 256 Elementary Cellular Automata of the 2D Plane", Complex Systems, 33(2), 2024.
|
|
LINKS
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|