|
%I #13 May 28 2024 18:26:56
%S 1,1,0,1,1,0,1,1,0,0,0,1,0,0,1,0,0,1,0,0,0,1,0,0,1,0,0,1,0,0,0,1,1,0,
%T 0,0,0,1,0,0,0,0,1,1,0,0,0,0,1,1,0,0,0,1,1,0,0,0,1,1,0,0,0,1,1,0,0,0,
%U 0,1,1,0,0,1,0,0,1,0,0,1,0,0,1,0,0,0,1,1,0,1,1,0,1,1,0,1,1,0,1,1,0,1,1,0,1,1,0,1,1,0,0,0,1,0,0,0,1,1,0,0,1,0,0,0,0,1,0,0,0
%N Center column of elementary triangular automaton rule 62, from a lone 1 cell.
%C 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.
%C Rule 62 (111110 in binary):
%C -----------------------------------------------
%C |state of the cell |1|1|1|1|0|0|0|0|
%C |sum of the neighbors' states |3|2|1|0|3|2|1|0|
%C |cell's next state |0|0|1|1|1|1|1|0|
%C -----------------------------------------------
%D Paul Cousin, "Triangular Automata: The 256 Elementary Cellular Automata of the 2D Plane", Complex Systems, 33(2), 2024.
%H Paul Cousin, <a href="/A371931/b371931.txt">Table of n, a(n) for n = 0..4096</a>
%H Paul Cousin, <a href="https://arxiv.org/abs/2309.15795">Triangular Automata: The 256 Elementary Cellular Automata of the 2D Plane</a>, arXiv:2309.15795 [nlin.CG], 2023.
%H Paul Cousin, <a href="https://paulcousin.github.io/triangular-automata">Triangular Automata</a>
%H Paul Cousin, <a href="https://paulcousin.github.io/triangular-automata/rules.html?rule= 62">Rule 62</a>
%H Paul Cousin, <a href="https://paulcousin.github.io/triangular-automata-mathematica/">Triangular Automata Mathematica Package</a>
%Y Cf. A371844, A372553, A372552.
%K nonn
%O 0
%A _Paul Cousin_, Apr 13 2024
|
