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

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A269907 Number of active (ON,black) cells at stage 2^n-1 of the two-dimensional cellular automaton defined by "Rule 1", based on the 5-celled von Neumann neighborhood. 1
1, 4, 44, 220, 956, 3964, 16124, 65020, 261116, 1046524, 4190204, 16769020, 67092476, 268402684, 1073676284, 4294836220 (list; graph; refs; listen; history; text; internal format)
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

Table of n, a(n) for n=0..15.

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

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, Mar 08 2016: (Start)

a(n) = 4*(4^n-2^n-1) for n>0.

a(n) = 7*a(n-1)-14*a(n-2)+8*a(n-3) for n>3.

G.f.: (1-3*x+30*x^2-40*x^3) / ((1-x)*(1-2*x)*(1-4*x)).

(End)

MATHEMATICA

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

code=1; 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}];

on=Map[Function[Apply[Plus, Flatten[#1]]], ca] (* Count ON cells at each stage *)

Part[on, 2^Range[0, Log[2, stages]]] (* Extract relevant terms *)

CROSSREFS

Cf. A269906.

Sequence in context: A265081 A077435 A271294 * A270130 A074751 A129551

Adjacent sequences:  A269904 A269905 A269906 * A269908 A269909 A269910

KEYWORD

nonn,more

AUTHOR

Robert Price, Mar 07 2016

EXTENSIONS

a(8)-a(15) from Lars Blomberg, Apr 08 2016

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 December 15 17:03 EST 2019. Contains 330000 sequences. (Running on oeis4.)