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 A285772 #8 Feb 16 2025 08:33:44 %S A285772 1,0,10,0,100,0,101000,0,10000,0,10100000,0,10001000000,0, %T A285772 10101010000000,0,100000000,0,101000000000,0,100010000000000,0, %U A285772 101010100000000000,0,100000001000000000000,0,101000001010000000000000,0,100010001000100000000000000,0 %N A285772 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 84", based on the 5-celled von Neumann neighborhood. %C A285772 Initialized with a single black (ON) cell at stage zero. %D A285772 S. Wolfram, A New Kind of Science, Wolfram Media, 2002; p. 170. %H A285772 Robert Price, <a href="/A285772/b285772.txt">Table of n, a(n) for n = 0..126</a> %H A285772 Robert Price, <a href="/A285772/a285772.tmp.txt">Diagrams of first 20 stages</a> %H A285772 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 A285772 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/ElementaryCellularAutomaton.html">Elementary Cellular Automaton</a> %H A285772 S. Wolfram, <a href="http://wolframscience.com/">A New Kind of Science</a> %H A285772 Wolfram Research, <a href="http://atlas.wolfram.com/">Wolfram Atlas of Simple Programs</a> %H A285772 <a href="/index/Ce#cell">Index entries for sequences related to cellular automata</a> %H A285772 <a href="https://oeis.org/wiki/Index_to_2D_5-Neighbor_Cellular_Automata">Index to 2D 5-Neighbor Cellular Automata</a> %H A285772 <a href="https://oeis.org/wiki/Index_to_Elementary_Cellular_Automata">Index to Elementary Cellular Automata</a> %t A285772 CAStep[rule_, a_] := Map[rule[[10 - #]] &, ListConvolve[{{0, 2, 0},{2, 1, 2}, {0, 2, 0}}, a, 2],{2}]; %t A285772 code = 84; stages = 128; %t A285772 rule = IntegerDigits[code, 2, 10]; %t A285772 g = 2 * stages + 1; (* Maximum size of grid *) %t A285772 a = PadLeft[{{1}}, {g, g}, 0,Floor[{g, g}/2]]; (* Initial ON cell on grid *) %t A285772 ca = a; %t A285772 ca = Table[ca = CAStep[rule, ca], {n, 1, stages + 1}]; %t A285772 PrependTo[ca, a]; %t A285772 (* Trim full grid to reflect growth by one cell at each stage *) %t A285772 k = (Length[ca[[1]]] + 1)/2; %t A285772 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 A285772 Table[FromDigits[Part[ca[[i]] [[i]], Range[i, 2 * i - 1]], 10], {i, 1, stages - 1}] %Y A285772 Cf. A285771, A285773, A285774. %K A285772 nonn,easy %O A285772 0,3 %A A285772 _Robert Price_, Apr 25 2017