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 A198514 #14 Aug 13 2020 14:02:28 %S A198514 1,3,6,9,11,22,22,23,29,29,35,36,36 %N A198514 Consider a cellular automaton on the square grid where we start at time 1 with a finite collection of cells in state 1 and with all cells in state 0. At any time t, if a cell is in state 0 and the sum of the states of its neighborhood is t, the cell switches to state t. At any time t, if no cell switches to state t, the growth stops. The sequence gives the largest lifetime of any configuration starting from n cells which are rook connected. %H A198514 Erich Friedman, <a href="https://erich-friedman.github.io/mathmagic/0902.html">Problem of the month September 2002</a> %e A198514 The solution for n=4 %e A198514 9 9 %e A198514 85 4 58 %e A198514 32 23 %e A198514 6311136 %e A198514 313 %e A198514 74 47 %e A198514 8 %Y A198514 Cf. A198515, A198516. %K A198514 nonn,more %O A198514 1,2 %A A198514 _Kausthub Gudipati_, Oct 26 2011