login
A270165
Number of active (ON, black) cells at stage 2^n-1 of the two-dimensional cellular automaton defined by "Rule 107", based on the 5-celled von Neumann neighborhood.
0
1, 5, 41, 197, 849, 3489, 14145, 56961, 228609, 915969, 3666945, 14673921, 58707969, 234856449, 939474945, 3757998081
OFFSET
0,2
COMMENTS
Initialized with a single black (ON) cell at stage zero.
REFERENCES
S. Wolfram, A New Kind of Science, Wolfram Media, 2002; p. 170.
FORMULA
Conjecture: a(n) = 14*4^(n-1) - 3*2^n + 1, n>3. - Lars Blomberg, Apr 25 2016
Conjectures from Colin Barker, Apr 25 2016: (Start)
a(n) = 7*a(n-1)-14*a(n-2)+8*a(n-3) for n>6.
G.f.: (1-2*x+20*x^2-28*x^3+4*x^4-24*x^5+32*x^6) / ((1-x)*(1-2*x)*(1-4*x)).
(End)
MATHEMATICA
CAStep[rule_, a_]:=Map[rule[[10-#]]&, ListConvolve[{{0, 2, 0}, {2, 1, 2}, {0, 2, 0}}, a, 2], {2}];
code=107; 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}];
on=Map[Function[Apply[Plus, Flatten[#1]]], ca] (* Count ON cells at each stage *)
Part[on, 2^Range[0, Log[2, stages]]] (* Extract relevant terms *)
CROSSREFS
Cf. A270164.
Sequence in context: A027954 A270623 A322420 * A270157 A322421 A357612
KEYWORD
nonn,more
AUTHOR
Robert Price, Mar 12 2016
EXTENSIONS
a(8)-a(15) from Lars Blomberg, Apr 25 2016
STATUS
approved