# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a279472
Showing 1-1 of 1

%I A279472 #8 Dec 13 2016 11:21:17
%S A279472 1,11,110,1110,11010,111010,1101110,11101010,110111110,1110100010,
%T A279472 11011100110,111010100110,1101111100110,11101000111110,
%U A279472 110111001100010,1110101001100110,11011111001110110,111010001101010110,1101110011101010110,11101010010101010110
%N A279472 Binary 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 158", based on the 5-celled von Neumann neighborhood.
%C A279472 Initialized with a single black (ON) cell at stage zero.
%D A279472 S. Wolfram, A New Kind of Science, Wolfram Media, 2002; p. 170.
%H A279472 Robert Price, <a href="/A279472/b279472.txt">Table of n, a(n) for n = 0..126</a>
%H A279472 Robert Price, <a href="/A279472/a279472.tmp.txt">Diagrams of first 20 stages</a>
%H A279472 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 A279472 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/ElementaryCellularAutomaton.html">Elementary Cellular Automaton</a>
%H A279472 S. Wolfram, <a href="http://wolframscience.com/">A New Kind of Science</a>
%H A279472 Wolfram Research, <a href="http://atlas.wolfram.com/">Wolfram Atlas of Simple Programs</a>
%H A279472 <a href="/index/Ce#cell">Index entries for sequences related to cellular automata</a>
%H A279472 <a href="https://oeis.org/wiki/Index_to_2D_5-Neighbor_Cellular_Automata">Index to 2D 5-Neighbor Cellular Automata</a>
%H A279472 <a href="https://oeis.org/wiki/Index_to_Elementary_Cellular_Automata">Index to Elementary Cellular Automata</a>
%t A279472 CAStep[rule_, a_] := Map[rule[[10 - #]] &, ListConvolve[{{0, 2, 0},{2, 1, 2}, {0, 2, 0}}, a, 2],{2}];
%t A279472 code = 158; stages = 128;
%t A279472 rule = IntegerDigits[code, 2, 10];
%t A279472 g = 2 * stages + 1; (* Maximum size of grid *)
%t A279472 a = PadLeft[{{1}}, {g, g}, 0,Floor[{g, g}/2]]; (* Initial ON cell on grid *)
%t A279472 ca = a;
%t A279472 ca = Table[ca = CAStep[rule, ca], {n, 1, stages + 1}];
%t A279472 PrependTo[ca, a];
%t A279472 (* Trim full grid to reflect growth by one cell at each stage *)
%t A279472 k = (Length[ca[[1]]] + 1)/2;
%t A279472 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 A279472 Table[FromDigits[Part[ca[[i]] [[i]], Range[1, i]], 10], {i, 1, stages - 1}]
%Y A279472 Cf. A279473, A279474, A279475.
%K A279472 nonn,easy
%O A279472 0,2
%A A279472 _Robert Price_, Dec 12 2016

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE