A372553 Center column of elementary triangular automaton rule 61, from a lone 1 cell.

1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1

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 61 (111101 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|1|1|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 61

Paul Cousin, Triangular Automata Mathematica Package

Crossrefs

Cf. A371844, A371931, A372552.

Sequence in context: A214330 A335909 A266591 * A359779 A373834 A132194

Adjacent sequences: A372550 A372551 A372552 * A372554 A372555 A372556

Keyword

nonn

Author

Paul Cousin, May 05 2024

Status

approved