A281751 - OEIS

%I #11 May 05 2024 10:41:40

%S 1,2,7,2,23,58,23,170,471,186,1367,3818,1367,11194,30039,12010,87383,

%T 244410,87383,715498,1922391,764858,5592407,15642346,5592407,45791930,

%U 123032919,48949994,357913943,1001106362,357913943,2930683626,7874106711,3132799674

%N Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 395", 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="/A281751/b281751.txt">Table of n, a(n) for n = 0..126</a>

%H Robert Price, <a href="/A281751/a281751.tmp.txt">Diagrams of first 20 stages</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 Wolfram Research, <a href="http://atlas.wolfram.com/">Wolfram Atlas of Simple Programs</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 _Chai Wah Wu_, May 05 2024: (Start)

%F a(n) = - 2*a(n-1) + 8*a(n-3) + 16*a(n-4) + a(n-8) + 2*a(n-9) - 8*a(n-11) - 16*a(n-12) for n > 19.

%F G.f.: (-1024*x^19 - 512*x^18 - 256*x^17 + 64*x^15 - 16*x^12 + 56*x^11 + 12*x^9 - 22*x^8 + 11*x^6 + 16*x^5 - 5*x^4 + 8*x^3 + 11*x^2 + 4*x + 1)/(16*x^12 + 8*x^11 - 2*x^9 - x^8 - 16*x^4 - 8*x^3 + 2*x + 1). (End)

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

%t code = 395; 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 Table[FromDigits[Part[ca[[i]] [[i]], Range[i, 2 * i - 1]], 2], {i ,1, stages - 1}]

%Y Cf. A281748, A281749, A281750.

%K nonn,easy

%O 0,2

%A _Robert Price_, Jan 29 2017