cp's OEIS Frontend

A283351 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 619", based on the 5-celled von Neumann neighborhood.

%I A283351 #9 Feb 16 2025 08:33:42
%S A283351 1,1,1,111,111,11111,11111,1111111,1111111,111111111,111111111,
%T A283351 11111111111,11111111111,1111111111111,1111111111111,111111111111111,
%U A283351 111111111111111,11111111111111111,11111111111111111,1111111111111111111,1111111111111111111
%N A283351 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 619", based on the 5-celled von Neumann neighborhood.
%C A283351 Initialized with a single black (ON) cell at stage zero.
%D A283351 S. Wolfram, A New Kind of Science, Wolfram Media, 2002; p. 170.
%H A283351 Robert Price, <a href="/A283351/b283351.txt">Table of n, a(n) for n = 0..126</a>
%H A283351 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 A283351 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/ElementaryCellularAutomaton.html">Elementary Cellular Automaton</a>
%H A283351 S. Wolfram, <a href="http://wolframscience.com/">A New Kind of Science</a>
%H A283351 Wolfram Research, <a href="http://atlas.wolfram.com/">Wolfram Atlas of Simple Programs</a>
%H A283351 <a href="/index/Ce#cell">Index entries for sequences related to cellular automata</a>
%H A283351 <a href="https://oeis.org/wiki/Index_to_2D_5-Neighbor_Cellular_Automata">Index to 2D 5-Neighbor Cellular Automata</a>
%H A283351 <a href="https://oeis.org/wiki/Index_to_Elementary_Cellular_Automata">Index to Elementary Cellular Automata</a>
%H A283351 Robert Price, <a href="/A283351/a283351.tmp.txt">Diagrams of first 20 stages</a>
%F A283351 Conjectures from _Colin Barker_, Mar 06 2017: (Start)
%F A283351 G.f.: (1 - 100*x^2 + 110*x^3) / ((1 - x)*(1 - 10*x)*(1 + 10*x)).
%F A283351 a(n) = (-20 - 9*(-10)^n + 11*10^n) / 180 for n>0.
%F A283351 a(n) = a(n-1) + 100*a(n-2) - 100*a(n-3) for n>3.
%F A283351 (End)
%t A283351 CAStep[rule_, a_] := Map[rule[[10 - #]] &, ListConvolve[{{0, 2, 0},{2, 1, 2}, {0, 2, 0}}, a, 2],{2}];
%t A283351 code = 619; stages = 128;
%t A283351 rule = IntegerDigits[code, 2, 10];
%t A283351 g = 2 * stages + 1; (* Maximum size of grid *)
%t A283351 a = PadLeft[{{1}}, {g, g}, 0,Floor[{g, g}/2]]; (* Initial ON cell on grid *)
%t A283351 ca = a;
%t A283351 ca = Table[ca = CAStep[rule, ca], {n, 1, stages + 1}];
%t A283351 PrependTo[ca, a];
%t A283351 (* Trim full grid to reflect growth by one cell at each stage *)
%t A283351 k = (Length[ca[[1]]] + 1)/2;
%t A283351 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 A283351 Table[FromDigits[Part[ca[[i]] [[i]], Range[1, i]], 10], {i, 1, stages - 1}]
%Y A283351 Cf. A283352, A283353.
%K A283351 nonn,easy
%O A283351 0,4
%A A283351 _Robert Price_, Mar 05 2017