|
%I #9 Mar 16 2017 15:00:49
%S 1,0,111,1011,111,101111,11111,10111111,1111111,1011111111,111111111,
%T 101111111111,11111111111,10111111111111,1111111111111,
%U 1011111111111111,111111111111111,101111111111111111,11111111111111111,10111111111111111111,1111111111111111111
%N 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 705", 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="/A283649/b283649.txt">Table of n, a(n) for n = 0..126</a>
%H Robert Price, <a href="/A283649/a283649.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>
%F Conjectures from _Colin Barker_, Mar 14 2017: (Start)
%F G.f.: (1 - x + 11*x^2 + 1000*x^3 - 12000*x^4 + 11000*x^5) / ((1 - x)*(1 - 10*x)*(1 + 10*x)).
%F a(n) = (-10 + 23*2^(1+n)*5^n - 9*(-2)^n*5^(1+n)) / 90 for n>2.
%F a(n) = a(n-1) + 100*a(n-2) - 100*a(n-3) for n>5.
%F (End)
%t CAStep[rule_, a_] := Map[rule[[10 - #]] &, ListConvolve[{{0, 2, 0},{2, 1, 2}, {0, 2, 0}}, a, 2],{2}];
%t code = 705; 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. A283648, A283650, A283651.
%K nonn,easy
%O 0,3
%A _Robert Price_, Mar 12 2017
| 