

A264039


Number of "POISONED" cells after n stages of the "UlamWarburton" twodimensional cellular automaton.


4



0, 0, 4, 4, 16, 16, 24, 24, 56, 56, 64, 64, 96, 96, 120, 120, 200, 200, 208, 208, 240, 240, 264, 264, 352, 352, 376, 376, 472, 472, 544, 544, 744, 744, 752, 752, 784, 784, 808, 808, 896, 896, 920, 920, 1016, 1016, 1088, 1088, 1312, 1312, 1336, 1336, 1432
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,3


COMMENTS

Previous analysis of this cellular automaton have concentrated on cells that turn "ON". This sequence examines those cells that are never turned ON.
This cellular automaton is generated by Rule 686 using the Wolfram numbering scheme.
A "POISONED" cell is one in which no further generation can possibly utilize that cell. That is, previous generations have ensured that more than one neighbor has been turned ON.
See A147562 for extensive definitions, references and links for this cellular automaton.
Note that the offset is zero, which implies that the initial cell is at stage n=1. This corresponds to that of A147562 where a(0)=0, a(1)=1, a(2)=5, etc. The Singmaster reference implies a(0)=1, a(1)=5, etc. The choice of offset is arbitrary and neither seems to be ideal.
Observations:
Cells are referenced by their coordinates on the x,yplane with the initial cell at (0,0).
G(i,j) is the generation where cell (i,j) is turned ON.
P(i,j) is the generation where cell (i,j) is POISONED.
Due to symmetry, analysis of only the (+,+) quadrant is necessary.
G(0,j) = j+1;
G(i,0) = i+1;
G(k,2^n1k) = 2^n;
G(2^n1k,k) = 2^n;
G(1,j) = j+2, when j is even;
G(i,1) = i+2, when i is even;
P(1,j) = j+1, when j is odd;
P(i,1) = i+1, when i is odd;
P(i,j) = k, when i,j are odd (a formula for k is not known at this time);
P(i,j) = 2^k when i=j>0, k=floor(log_2(i1))+2.
After iterations 2^k, all cells with i+j<=2^k are either ON or POISONED.
On iterations 2^k+1, only 4 cells turned on: (0,2^k), (2^k,0), (0,2^k), (2^k,0).
Newly turned ON cells are always adjacent to one turned ON in the previous generation.
Number of POISONED cells approach 1/2 the number of ON cells as n increases.


REFERENCES

D. Singmaster, On the cellular automaton of Ulam and Warburton, M500 Magazine of the Open University, #195 (December 2003), pp. 27.
S. Ulam, On some mathematical problems connected with patterns of growth of figures, pp. 215224 of R. E. Bellman, ed., Mathematical Problems in the Biological Sciences, Proc. Sympos. Applied Math., Vol. 14, Amer. Math. Soc., 1962.
S. Wolfram, A New Kind of Science, Wolfram Media, 2002; p. 928.


LINKS

Robert Price and JungHwan Min, Table of n, a(n) for n = 0..2500 [Terms 0 through 1030 were computed by Robert Price; terms 1031 through 2500 by JungHwan Min, Jan 25 2016]


MATHEMATICA

A264039[0] = 0; A264039[n_] := Count[CellularAutomaton[{87187427557048763150324539564085781570417592761754781363597847633270219467927638113927266203006607594674647506320503, 3, {{0, 1}, {1, 0}, {0, 0}, {1, 0}, {0, 1}}}, {{{1}}, 0}, {{{n}}}], 2, 2] (* JungHwan Min, Jan 25 2016 *)
A264039[0] = 0; A264039[n_] := Total[With[{m = n  1}, CellularAutomaton[{336, {2, {{0, 2, 0}, {2, 1, 2}, {0, 2, 0}}}, {1, 1}}, #, {{{1}}}] &@ CellularAutomaton[{686, {2, {{0, 2, 0}, {2, 1, 2}, {0, 2, 0}}}, {1, 1}}, {{{1}}, 0}, {{{m}}}]], 2] (* JungHwan Min, Jan 25 2016 *)


CROSSREFS



KEYWORD

nonn


AUTHOR



STATUS

approved



