A284244 - OEIS

%I #10 May 06 2024 16:55:07

%S 1,0,110,1110,11110,101110,101110,10111110,11111110,1110101110,

%T 11010101110,101010111110,101011111110,10101110101110,10101010101110,

%U 1010101010111110,1010101011111110,101010101110101110,101010101010101110,10101010101010111110

%N Binary 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 841", 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="/A284244/b284244.txt">Table of n, a(n) for n = 0..126</a>

%H Robert Price, <a href="/A284244/a284244.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 06 2024: (Start)

%F a(n) = 100*a(n-2) + a(n-4) - 100*a(n-6) for n > 16.

%F G.f.: (1000000000000*x^16 - 10000000000*x^14 - 1000000000000*x^12 - 10000000000*x^11 + 9900000000*x^10 + 99000000*x^9 + 1000000*x^8 - 1000*x^7 - 1009900*x^6 - 9890*x^5 + 109*x^4 + 1110*x^3 + 10*x^2 + 1)/(100*x^6 - x^4 - 100*x^2 + 1). (End)

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

%t code = 841; 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]], 10], {i, 1, stages - 1}]

%Y Cf. A284243, A284245, A284246.

%K nonn,easy

%O 0,3

%A _Robert Price_, Mar 23 2017