login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A273489 Number of active (ON,black) cells at stage 2^n-1 of the two-dimensional cellular automaton defined by "Rule 758", based on the 5-celled von Neumann neighborhood. 0

%I

%S 1,5,21,85,413,1765,7325,30085,122813,499045,2020445,8156485,32854013,

%T 132108325,530526365,2128417285

%N Number of active (ON,black) cells at stage 2^n-1 of the two-dimensional cellular automaton defined by "Rule 758", 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 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 Conjecture: a(n) = 2*4^n - 4*3^(n-1) + 2*2^n - 23, n>2. - _Lars Blomberg_, Jul 20 2016

%F Conjectures from _Colin Barker_, Jul 20 2016: (Start)

%F a(n) = 10*a(n-1)-35*a(n-2)+50*a(n-3)-24*a(n-4) for n>6.

%F G.f.: (1-5*x+6*x^2+72*x^4-320*x^5+384*x^6) / ((1-x)*(1-2*x)*(1-3*x)*(1-4*x)).

%F (End)

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

%t code=758; 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 Part[on,2^Range[0,Log[2,stages]]] (* Extract relevant terms *)

%Y Cf. A273486.

%K nonn,more

%O 0,2

%A _Robert Price_, May 23 2016

%E a(8)-a(15) from _Lars Blomberg_, Jul 20 2016

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 8 02:45 EDT 2020. Contains 336290 sequences. (Running on oeis4.)