Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #25 Jan 03 2025 12:45:12
%S 0,1,0,0,0,1,0,1,0,1,0,0,0,0,0,1,0,1,0,1,0,1,0,0,0,1,0,0,0,1,0,0,0,0,
%T 0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,1,0,0,0,1,0,0,0,1,0,0,0,1,0,0,0,1,
%U 0,0,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0,0,0,0,1,0,0,0,1,0,1,0,1,0,1,0,1,0,1,0,0,0,1,0,0,0,1,0,1,0,1,0,0,0,0,0,1,0,0,0,0,0,1,0
%N Second center column of elementary triangular automaton rule 210, 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 210 (11010010 in binary): "cells with one 1 neighbor change state"
%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 |1|1|0|1|0|0|1|0|
%C -----------------------------------------------
%C The second center column is the sequence of states of the direct neighbors of the initial 1 cell.
%H Paul Cousin, <a href="/A374413/b374413.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/?p=rule-210">Rule 210</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. A372581, A374769.
%K nonn,changed
%O 0
%A _Paul Cousin_, Jul 08 2024