|
%I #21 Sep 08 2022 08:46:17
%S 1,3,3,7,11,23,43,87,171,343,683,1367,2731,5463,10923,21847,43691,
%T 87383,174763,349527,699051,1398103,2796203,5592407,11184811,22369623,
%U 44739243,89478487,178956971,357913943,715827883,1431655767,2863311531,5726623063
%N Decimal 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 14", based on the 5-celled von Neumann neighborhood.
%C Initialized with a single black (ON) cell at stage zero.
%C Essentially the same as A267052. - _R. J. Mathar_, Nov 09 2016
%D S. Wolfram, A New Kind of Science, Wolfram Media, 2002; p. 170.
%H Robert Price, <a href="/A277955/b277955.txt">Table of n, a(n) for n = 0..126</a>
%H Robert Price, <a href="/A277955/a277955.tmp.txt">Diagrams of the 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 <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 G.f.: (1 + x - 4*x^2)/(1 - 2*x - x^2 + 2*x^3). - _Robert G. Wilson v_, Nov 05 2016
%F From _Colin Barker_, Nov 06 2016: (Start)
%F a(n) = (3 - 2*(-1)^n + 2^(1+n))/3.
%F a(n) = 2*a(n-1) + a(n-2) - 2*a(n-3) for n>2. (End)
%t CAStep[rule_,a_]:=Map[rule[[10-#]]&,ListConvolve[{{0,2,0},{2,1,2},{0,2,0}},a,2],{2}];
%t code=14; 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]],2], {i,1,stages-1}]
%t LinearRecurrence[{2, 1, -2}, {1, 3, 3}, 32] (* or *)
%t CoefficientList[ Series[(1 + x - 4x^2)/(1 - 2x - x^2 + 2x^3), {x, 0, 31}], x] (* _Robert G. Wilson v_, Nov 05 2016 *)
%o (Magma) I:=[1,3,3]; [n le 3 select I[n] else 2*Self(n-1)+Self(n-2)-2*Self(n-3): n in [1..40]]; // _Vincenzo Librandi_, Nov 06 2016
%Y Cf. A277952, A277953, A277954.
%K nonn,easy
%O 0,2
%A _Robert Price_, Nov 05 2016
|
