A286859 Binary representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 813", based on the 5-celled von Neumann neighborhood.

1, 10, 111, 1110, 11111, 111111, 1111111, 11111111, 111111111, 1111110000, 11111111111, 111111111111, 1111111111111, 11111111111111, 111111111111111, 1111111111111111, 11111111111111111, 111111111100011111, 1111111111111111111, 11111111111111111111

Offset

0,2

Comments

Initialized with a single black (ON) cell at stage zero.

References

S. Wolfram, A New Kind of Science, Wolfram Media, 2002; p. 170.

Links

Robert Price, Table of n, a(n) for n = 0..126

Robert Price, Diagrams of first 20 stages

N. J. A. Sloane, On the Number of ON Cells in Cellular Automata, arXiv:1503.01168 [math.CO], 2015

Eric Weisstein's World of Mathematics, Elementary Cellular Automaton

S. Wolfram, A New Kind of Science

Wolfram Research, Wolfram Atlas of Simple Programs

Index entries for sequences related to cellular automata

Index to 2D 5-Neighbor Cellular Automata

Index to Elementary Cellular Automata

Mathematica

CAStep[rule_, a_] := Map[rule[[10 - #]] &, ListConvolve[{{0, 2, 0}, {2, 1, 2}, {0, 2, 0}}, a, 2], {2}];
code = 813; stages = 128;
rule = IntegerDigits[code, 2, 10];
g = 2 * stages + 1; (* Maximum size of grid *)
a = PadLeft[{{1}}, {g, g}, 0, Floor[{g, g}/2]]; (* Initial ON cell on grid *)
ca = a;
ca = Table[ca = CAStep[rule, ca], {n, 1, stages + 1}];
PrependTo[ca, a];
(* Trim full grid to reflect growth by one cell at each stage *)
k = (Length[ca[[1]]] + 1)/2;
ca = Table[Table[Part[ca[[n]] [[j]], Range[k + 1 - n, k - 1 + n]], {j, k + 1 - n, k - 1 + n}], {n, 1, k}];
Table[FromDigits[Part[ca[[i]] [[i]], Range[i, 2 * i - 1]], 10], {i, 1, stages - 1}]

Crossrefs

Cf. A286860, A286861, A286862.

Sequence in context: A289184 A290191 A286827 * A290680 A268609 A289937

Adjacent sequences: A286856 A286857 A286858 * A286860 A286861 A286862

Keyword

nonn,easy

Author

Robert Price, Aug 01 2017

Status

approved