|
%I #9 Jul 26 2024 21:16:31
%S 3,1,27,-19,71,-55,139,-135,235,-207,355,-363,527,-459,627,-643,859,
%T -779,1003,-1007,1319,-1279,1563,-1563,1887,-1803,2175,-2163,2495,
%U -2375,2751,-2767,3195,-3071,3607,-3683,4107,-3931,4479,-4603,5191,-4899,5287,-5299
%N First differences of number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 41", 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="/A269875/b269875.txt">Table of n, a(n) for n = 0..99</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>
%t code=41; stages=100;
%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 on=Map[Function[Apply[Plus,Flatten[#1]]],ca] (* Count ON cells at each stage *)
%t Table[on[[i+1]]-on[[i]],{i,1,Length[on]-1}] (* Difference at each stage *)
%Y Cf. A269872.
%K sign,easy
%O 0,1
%A _Robert Price_, Mar 06 2016
|
