%I #18 Jan 05 2025 08:03:48
%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 -----------------------------------------------
%H Paul Cousin, <a href="/A371931/b371931.txt">Table of n, a(n) for n = 0..16384</a>
%H Paul Cousin, <a href="https://triangular-automata.net/">Triangular Automata</a>
%H Paul Cousin, <a href="https://triangular-automata.net/rules.html?rule=62">Rule 62</a>
%H Paul Cousin, <a href="https://doi.org/10.25088/ComplexSystems.33.3.253">Triangular Automata: The 256 Elementary Cellular Automata of the Two-Dimensional Plane</a>, Complex Systems, 33(3), 2024, pp. 253-276.
%Y Cf. A371844, A372553, A372552.
%K nonn
%O 0
%A _Paul Cousin_, Apr 13 2024