login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A287191 Binary representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 253", based on the 5-celled von Neumann neighborhood. 4
1, 1, 0, 111, 11000, 11111, 1100000, 1111111, 110000000, 111111111, 11000000000, 11111111111, 1100000000000, 1111111111111, 110000000000000, 111111111111111, 11000000000000000, 11111111111111111, 1100000000000000000, 1111111111111111111 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

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

FORMULA

Conjectures from Colin Barker, Nov 22 2017: (Start)

G.f.: (1 + x - 101*x^2 + 10*x^3 + 11100*x^4 - 11000*x^6) / ((1 - x)*(1 + x)*(1 - 10*x)*(1 + 10*x)).

a(n) = (1/180)*(-10 + 89*(-10)^n + 10*(-1)^n + 109*10^n) for n>2.

a(n) = 101*a(n-2) - 100*a(n-4) for n>4.

(End)

MATHEMATICA

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

code = 253; 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. A287190, A287192, A287193.

Sequence in context: A286504 A286404 A287130 * A245549 A266809 A152764

Adjacent sequences:  A287188 A287189 A287190 * A287192 A287193 A287194

KEYWORD

nonn,easy

AUTHOR

Robert Price, May 21 2017

STATUS

approved

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 October 21 06:25 EDT 2019. Contains 328292 sequences. (Running on oeis4.)