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 A381734 #15 May 21 2025 01:27:30 %S A381734 1,4,10,19,28,37,58,73,88,115,136,163,178,247,280,307,334,391,400,463, %T A381734 526,595,622,679,754,811,862,925,1036,1057,1168,1249,1318,1321,1468, %U A381734 1531,1618,1723,1840,1939,2032,2155,2230,2323,2572,2617,2722,2785,2926,2935 %N A381734 Population of elementary triangular automaton rule 190 at generation n, starting from a lone 1 cell at generation 0. %C A381734 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 A381734 Rule 190 (10111110 in binary): %C A381734 ----------------------------------------------- %C A381734 |state of the cell |1|1|1|1|0|0|0|0| %C A381734 |sum of the neighbors' states |3|2|1|0|3|2|1|0| %C A381734 |cell's next state |1|0|1|1|1|1|1|0| %C A381734 ----------------------------------------------- %H A381734 Paul Cousin, <a href="/A381734/b381734.txt">Table of n, a(n) for n = 0..16384</a> %H A381734 Paul Cousin, <a href="/A381734/a381734.pdf">Illustration for n = 0..64</a> %H A381734 Paul Cousin, <a href="https://triangular-automata.net">Triangular Automata</a> %H A381734 Paul Cousin, <a href="https://triangular-automata.net/rules.html?rule=190">Rule 190</a> %H A381734 Paul Cousin, <a href="https://triangular-automata.net/?p=integer-sequences">Triangular Automata Integer Sequences</a> %H A381734 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 A381734 Cf. A381735, A380012, A380670, A372581. %K A381734 nonn %O A381734 0,2 %A A381734 _Paul Cousin_, Mar 05 2025