login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A273745 First differences of number of active (ON,black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 901", based on the 5-celled von Neumann neighborhood. 2

%I #16 May 30 2016 04:22:08

%S 7,17,24,32,40,48,56,64,72,80,88,96,104,112,120,128,136,144,152,160,

%T 168,176,184,192,200,208,216,224,232,240,248,256,264,272,280,288,296,

%U 304,312,320,328,336,344,352,360,368,376,384,392,400,408,416,424,432

%N First differences of number of active (ON,black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 901", 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="/A273745/b273745.txt">Table of n, a(n) for n = 0..127</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 Conjectures from _Colin Barker_, May 29 2016: (Start)

%F a(n) = 8*(1+n) = A273315(n) for n>1.

%F a(n) = 2*a(n-1)-a(n-2) for n>3.

%F G.f.: (1+x)*(7-4*x+x^2) / (1-x)^2.

%F (End)

%t CAStep[rule_,a_]:=Map[rule[[10-#]]&,ListConvolve[{{0,2,0},{2,1,2},{0,2,0}},a,2],{2}];

%t code=901; 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 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. A273743.

%K nonn,easy

%O 0,1

%A _Robert Price_, May 28 2016

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 11:35 EDT 2024. Contains 371912 sequences. (Running on oeis4.)