A371844 Center column of elementary triangular automaton rule 37, from a lone 1 cell.

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.

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 37

Paul Cousin, Triangular Automata Mathematica Package

Crossrefs

Cf. A372553, A371931, A372552.

Sequence in context: A365807 A173857 A114482 * A365799 A186518 A127829

Adjacent sequences: A371841 A371842 A371843 * A371845 A371846 A371847

Keyword

nonn

Author

Paul Cousin, Apr 08 2024

Status

approved