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 A283650 #10 Feb 16 2025 08:33:42 %S A283650 1,0,7,13,28,61,124,253,508,1021,2044,4093,8188,16381,32764,65533, %T A283650 131068,262141,524284,1048573,2097148,4194301,8388604,16777213, %U A283650 33554428,67108861,134217724,268435453,536870908,1073741821,2147483644,4294967293,8589934588 %N A283650 Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 705", based on the 5-celled von Neumann neighborhood. %C A283650 Initialized with a single black (ON) cell at stage zero. %D A283650 S. Wolfram, A New Kind of Science, Wolfram Media, 2002; p. 170. %H A283650 Robert Price, <a href="/A283650/b283650.txt">Table of n, a(n) for n = 0..126</a> %H A283650 Robert Price, <a href="/A283650/a283650.tmp.txt">Diagrams of first 20 stages</a> %H A283650 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 A283650 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/ElementaryCellularAutomaton.html">Elementary Cellular Automaton</a> %H A283650 S. Wolfram, <a href="http://wolframscience.com/">A New Kind of Science</a> %H A283650 Wolfram Research, <a href="http://atlas.wolfram.com/">Wolfram Atlas of Simple Programs</a> %H A283650 <a href="/index/Ce#cell">Index entries for sequences related to cellular automata</a> %H A283650 <a href="https://oeis.org/wiki/Index_to_2D_5-Neighbor_Cellular_Automata">Index to 2D 5-Neighbor Cellular Automata</a> %H A283650 <a href="https://oeis.org/wiki/Index_to_Elementary_Cellular_Automata">Index to Elementary Cellular Automata</a> %F A283650 Conjectures from _Colin Barker_, Mar 14 2017: (Start) %F A283650 G.f.: (1 - 2*x + 6*x^2 + x^3 - 5*x^4 + 6*x^5) / ((1 - x)*(1 + x)*(1 - 2*x)). %F A283650 a(n) = 2*(2^n - 2) for n>2 and even. %F A283650 a(n) = 2^(n+1) - 3 for n>2 and odd. %F A283650 a(n) = 2*a(n-1) + a(n-2) - 2*a(n-3) for n>5. %F A283650 (End) %t A283650 CAStep[rule_, a_] := Map[rule[[10 - #]] &, ListConvolve[{{0, 2, 0},{2, 1, 2}, {0, 2, 0}}, a, 2],{2}]; %t A283650 code = 705; stages = 128; %t A283650 rule = IntegerDigits[code, 2, 10]; %t A283650 g = 2 * stages + 1; (* Maximum size of grid *) %t A283650 a = PadLeft[{{1}}, {g, g}, 0,Floor[{g, g}/2]]; (* Initial ON cell on grid *) %t A283650 ca = a; %t A283650 ca = Table[ca = CAStep[rule, ca], {n, 1, stages + 1}]; %t A283650 PrependTo[ca, a]; %t A283650 (* Trim full grid to reflect growth by one cell at each stage *) %t A283650 k = (Length[ca[[1]]] + 1)/2; %t A283650 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 A283650 Table[FromDigits[Part[ca[[i]] [[i]], Range[1, i]], 2], {i, 1, stages - 1}] %Y A283650 Cf. A283648, A283649, A283651. %K A283650 nonn,easy %O A283650 0,3 %A A283650 _Robert Price_, Mar 12 2017