# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/ Search: id:a271603 Showing 1-1 of 1 %I A271603 #9 Jul 26 2024 21:16:38 %S A271603 1,4,28,136,604,2596,10308,41756,167884,666916,2644596,10503884, %T A271603 41783516,166468132,664068284,2651397964 %N A271603 Number of active (ON, black) cells at stage 2^n-1 of the two-dimensional cellular automaton defined by "Rule 393", based on the 5-celled von Neumann neighborhood. %C A271603 Initialized with a single black (ON) cell at stage zero. %D A271603 S. Wolfram, A New Kind of Science, Wolfram Media, 2002; p. 170. %H A271603 N. J. A. Sloane, On the Number of ON Cells in Cellular Automata, arXiv:1503.01168 [math.CO], 2015 %H A271603 Eric Weisstein's World of Mathematics, Elementary Cellular Automaton %H A271603 S. Wolfram, A New Kind of Science %H A271603 Index entries for sequences related to cellular automata %H A271603 Index to 2D 5-Neighbor Cellular Automata %H A271603 Index to Elementary Cellular Automata %t A271603 CAStep[rule_,a_]:=Map[rule[[10-#]]&,ListConvolve[{{0,2,0},{2,1,2},{0,2,0}},a,2],{2}]; %t A271603 code=393; stages=128; %t A271603 rule=IntegerDigits[code,2,10]; %t A271603 g=2*stages+1; (* Maximum size of grid *) %t A271603 a=PadLeft[{{1}},{g,g},0,Floor[{g,g}/2]]; (* Initial ON cell on grid *) %t A271603 ca=a; %t A271603 ca=Table[ca=CAStep[rule,ca],{n,1,stages+1}]; %t A271603 PrependTo[ca,a]; %t A271603 (* Trim full grid to reflect growth by one cell at each stage *) %t A271603 k=(Length[ca[[1]]]+1)/2; %t A271603 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 A271603 on=Map[Function[Apply[Plus,Flatten[#1]]],ca] (* Count ON cells at each stage *) %t A271603 Part[on,2^Range[0,Log[2,stages]]] (* Extract relevant terms *) %Y A271603 Cf. A271602. %K A271603 nonn,more %O A271603 0,2 %A A271603 _Robert Price_, Apr 10 2016 %E A271603 a(8)-a(15) from _Lars Blomberg_, Jun 22 2016 # Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE