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 A287196 #12 May 28 2025 14:14:24 %S A287196 1,11,100,11,10000,1111,1000000,111111,100000000,11111111,10000000000, %T A287196 1111111111,1000000000000,111111111111,100000000000000,11111111111111, %U A287196 10000000000000000,1111111111111111,1000000000000000000,111111111111111111,100000000000000000000 %N A287196 Binary representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 259", based on the 5-celled von Neumann neighborhood. %C A287196 Initialized with a single black (ON) cell at stage zero. %C A287196 Seems to differ from A277798 only at n=1. - _R. J. Mathar_, May 28 2025 %D A287196 S. Wolfram, A New Kind of Science, Wolfram Media, 2002; p. 170. %H A287196 Robert Price, <a href="/A287196/b287196.txt">Table of n, a(n) for n = 0..126</a> %H A287196 Robert Price, <a href="/A287196/a287196.tmp.txt">Diagrams of first 20 stages</a> %H A287196 N. J. A. Sloane, <a href="http://arxiv.org/abs/1503.01168">On the Number of ON Cells in Cellular Automata</a>, arXiv:1503.01168 [math.CO], 2015 %H A287196 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/ElementaryCellularAutomaton.html">Elementary Cellular Automaton</a> %H A287196 S. Wolfram, <a href="http://wolframscience.com/">A New Kind of Science</a> %H A287196 Wolfram Research, <a href="http://atlas.wolfram.com/">Wolfram Atlas of Simple Programs</a> %H A287196 <a href="/index/Ce#cell">Index entries for sequences related to cellular automata</a> %H A287196 <a href="https://oeis.org/wiki/Index_to_2D_5-Neighbor_Cellular_Automata">Index to 2D 5-Neighbor Cellular Automata</a> %H A287196 <a href="https://oeis.org/wiki/Index_to_Elementary_Cellular_Automata">Index to Elementary Cellular Automata</a> %t A287196 CAStep[rule_, a_] := Map[rule[[10 - #]] &, ListConvolve[{{0, 2, 0},{2, 1, 2}, {0, 2, 0}}, a, 2],{2}]; %t A287196 code = 259; stages = 128; %t A287196 rule = IntegerDigits[code, 2, 10]; %t A287196 g = 2 * stages + 1; (* Maximum size of grid *) %t A287196 a = PadLeft[{{1}}, {g, g}, 0,Floor[{g, g}/2]]; (* Initial ON cell on grid *) %t A287196 ca = a; %t A287196 ca = Table[ca = CAStep[rule, ca], {n, 1, stages + 1}]; %t A287196 PrependTo[ca, a]; %t A287196 (* Trim full grid to reflect growth by one cell at each stage *) %t A287196 k = (Length[ca[[1]]] + 1)/2; %t A287196 ca = Table[Table[Part[ca[[n]] [[j]],Range[k + 1 - n, k - 1 + n]], {j, k + 1 - n, k - 1 + n}], {n, 1, k}]; %t A287196 Table[FromDigits[Part[ca[[i]] [[i]], Range[i, 2 * i - 1]], 10], {i, 1, stages - 1}] %Y A287196 Cf. A287194, A287197, A287199. %K A287196 nonn,easy %O A287196 0,2 %A A287196 _Robert Price_, May 21 2017