cp's OEIS Frontend

A282386 Binary representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 462", based on the 5-celled von Neumann neighborhood.

%I A282386 #9 Feb 16 2025 08:33:41
%S A282386 1,11,11,1111,11,1111,110011,11111111,11,1111,110011,11111111,
%T A282386 1100000011,111100001111,11001100110011,1111111111111111,11,1111,
%U A282386 110011,11111111,1100000011,111100001111,11001100110011,1111111111111111,110000000000000011
%N A282386 Binary representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 462", based on the 5-celled von Neumann neighborhood.
%C A282386 Initialized with a single black (ON) cell at stage zero.
%D A282386 S. Wolfram, A New Kind of Science, Wolfram Media, 2002; p. 170.
%H A282386 Robert Price, <a href="/A282386/b282386.txt">Table of n, a(n) for n = 0..126</a>
%H A282386 Robert Price, <a href="/A282386/a282386.tmp.txt">Diagrams of first 20 stages</a>
%H A282386 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 A282386 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/ElementaryCellularAutomaton.html">Elementary Cellular Automaton</a>
%H A282386 S. Wolfram, <a href="http://wolframscience.com/">A New Kind of Science</a>
%H A282386 Wolfram Research, <a href="http://atlas.wolfram.com/">Wolfram Atlas of Simple Programs</a>
%H A282386 <a href="/index/Ce#cell">Index entries for sequences related to cellular automata</a>
%H A282386 <a href="https://oeis.org/wiki/Index_to_2D_5-Neighbor_Cellular_Automata">Index to 2D 5-Neighbor Cellular Automata</a>
%H A282386 <a href="https://oeis.org/wiki/Index_to_Elementary_Cellular_Automata">Index to Elementary Cellular Automata</a>
%t A282386 CAStep[rule_, a_] := Map[rule[[10 - #]] &, ListConvolve[{{0, 2, 0},{2, 1, 2}, {0, 2, 0}}, a, 2],{2}];
%t A282386 code = 462; stages = 128;
%t A282386 rule = IntegerDigits[code, 2, 10];
%t A282386 g = 2 * stages + 1; (* Maximum size of grid *)
%t A282386 a = PadLeft[{{1}}, {g, g}, 0,Floor[{g, g}/2]]; (* Initial ON cell on grid *)
%t A282386 ca = a;
%t A282386 ca = Table[ca = CAStep[rule, ca], {n, 1, stages + 1}];
%t A282386 PrependTo[ca, a];
%t A282386 (* Trim full grid to reflect growth by one cell at each stage *)
%t A282386 k = (Length[ca[[1]]] + 1)/2;
%t A282386 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 A282386 Table[FromDigits[Part[ca[[i]] [[i]], Range[i, 2 * i - 1]], 10], {i, 1, stages - 1}]
%Y A282386 Cf. A282385, A282387, A282388.
%K A282386 nonn,easy
%O A282386 0,2
%A A282386 _Robert Price_, Feb 13 2017