Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #8 May 31 2017 13:09:39
%S 1,2,2,8,28,0,24,192,48,384,1248,2304,3520,6656,19328,41984,46848,
%T 100352,290304,724992,711680,1712128,4438016,12075008,9138176,
%U 29917184,74375168,184614912,183353344,438435840,1153138688,3053715456,2746679296,7390887936
%N Decimal 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 350", based on the 5-celled von Neumann neighborhood.
%C Initialized with a single black (ON) cell at stage zero.
%D S. Wolfram, A New Kind of Science, Wolfram Media, 2002; p. 170.
%H Robert Price, <a href="/A287756/b287756.txt">Table of n, a(n) for n = 0..126</a>
%H Robert Price, <a href="/A287756/a287756.tmp.txt">Diagrams of first 20 stages</a>
%H 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 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/ElementaryCellularAutomaton.html">Elementary Cellular Automaton</a>
%H S. Wolfram, <a href="http://wolframscience.com/">A New Kind of Science</a>
%H Wolfram Research, <a href="http://atlas.wolfram.com/">Wolfram Atlas of Simple Programs</a>
%H <a href="/index/Ce#cell">Index entries for sequences related to cellular automata</a>
%H <a href="https://oeis.org/wiki/Index_to_2D_5-Neighbor_Cellular_Automata">Index to 2D 5-Neighbor Cellular Automata</a>
%H <a href="https://oeis.org/wiki/Index_to_Elementary_Cellular_Automata">Index to Elementary Cellular Automata</a>
%t CAStep[rule_, a_] := Map[rule[[10 - #]] &, ListConvolve[{{0, 2, 0},{2, 1, 2}, {0, 2, 0}}, a, 2],{2}];
%t code = 350; stages = 128;
%t rule = IntegerDigits[code, 2, 10];
%t g = 2 * stages + 1; (* Maximum size of grid *)
%t a = PadLeft[{{1}}, {g, g}, 0,Floor[{g, g}/2]]; (* Initial ON cell on grid *)
%t ca = a;
%t ca = Table[ca = CAStep[rule, ca], {n, 1, stages + 1}];
%t PrependTo[ca, a];
%t (* Trim full grid to reflect growth by one cell at each stage *)
%t k = (Length[ca[[1]]] + 1)/2;
%t 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 Table[FromDigits[Part[ca[[i]] [[i]], Range[i, 2 * i - 1]], 10], {i, 1, stages - 1}]
%Y Cf. A287753, A287754, A287755.
%K nonn,easy
%O 0,2
%A _Robert Price_, May 31 2017