A273334 Number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 657", based on the 5-celled von Neumann neighborhood.
1, 4, 17, 48, 80, 120, 168, 224, 288, 360, 440, 528, 624, 728, 840, 960, 1088, 1224, 1368, 1520, 1680, 1848, 2024, 2208, 2400, 2600, 2808, 3024, 3248, 3480, 3720, 3968, 4224, 4488, 4760, 5040, 5328, 5624, 5928, 6240, 6560, 6888, 7224, 7568, 7920, 8280, 8648
Offset: 0
References
- S. Wolfram, A New Kind of Science, Wolfram Media, 2002; p. 170.
Links
- Robert Price, Table of n, a(n) for n = 0..128
- Robert Price, Diagrams of the first 20 stages
- N. J. A. Sloane, On the Number of ON Cells in Cellular Automata, arXiv:1503.01168 [math.CO], 2015
- Eric Weisstein's World of Mathematics, Elementary Cellular Automaton
- S. Wolfram, A New Kind of Science
- Index entries for sequences related to cellular automata
- Index to 2D 5-Neighbor Cellular Automata
- Index to Elementary Cellular Automata
Programs
-
Mathematica
CAStep[rule_,a_]:=Map[rule[[10-#]]&,ListConvolve[{{0,2,0},{2,1,2},{0,2,0}},a,2],{2}]; code=657; stages=128; rule=IntegerDigits[code,2,10]; g=2*stages+1; (* Maximum size of grid *) a=PadLeft[{{1}},{g,g},0,Floor[{g,g}/2]]; (* Initial ON cell on grid *) ca=a; ca=Table[ca=CAStep[rule,ca],{n,1,stages+1}]; PrependTo[ca,a]; (* Trim full grid to reflect growth by one cell at each stage *) k=(Length[ca[[1]]]+1)/2; ca=Table[Table[Part[ca[[n]][[j]],Range[k+1-n,k-1+n]],{j,k+1-n,k-1+n}],{n,1,k}]; Map[Function[Apply[Plus,Flatten[#1]]],ca] (* Count ON cells at each stage *)
Formula
Conjectures from Colin Barker, May 20 2016: (Start)
a(n) = 4*n*(1+n) for n>2.
a(n) = 3*a(n-1)-3*a(n-2)+a(n-3) for n>5.
G.f.: (1+x+8*x^2+8*x^3-17*x^4+7*x^5) / (1-x)^3.
(End)
Comments