This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A372581 #42 May 20 2025 00:18:53 %S A372581 1,4,7,13,7,28,25,46,13,46,49,85,43,115,97,178,55,136,97,202,91,268, %T A372581 157,343,151,376,217,439,229,580,349,643,337,595,421,631,481,793,481, %U A372581 781,439,877,583,997,577,1192,787,1297,799,1429,805,1438,889,1765,991,1822,1039,1969,1267,2200 %N A372581 Population of elementary triangular automaton rule 210 at generation n, starting from a lone 1 cell at generation 0. %C A372581 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 A372581 Rule 210 (11010010 in binary): "cells with one 1 neighbor change state" %C A372581 ----------------------------------------------- %C A372581 |state of the cell |1|1|1|1|0|0|0|0| %C A372581 |sum of the neighbors' states |3|2|1|0|3|2|1|0| %C A372581 |cell's next state |1|1|0|1|0|0|1|0| %C A372581 ----------------------------------------------- %H A372581 Paul Cousin, <a href="/A372581/b372581.txt">Table of n, a(n) for n = 0..65537</a> %H A372581 Paul Cousin, <a href="/A372581/a372581.pdf">Illustration for n = 0..128</a> %H A372581 Paul Cousin, <a href="https://triangular-automata.net">Triangular Automata</a> %H A372581 Paul Cousin, <a href="https://triangular-automata.net/?p=rule-210">Rule 210</a> %H A372581 Paul Cousin, <a href="https://triangular-automata.net/?p=integer-sequences">Triangular Automata Integer Sequences</a> %H A372581 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 A372581 Cf. A374413. %K A372581 nonn %O A372581 0,2 %A A372581 _Paul Cousin_, May 05 2024