OFFSET
0,2
COMMENTS
The neighborhood of a cell consists of the six surrounding cells (but not the cell itself). A cell is ON at generation n iff an odd number of its neighbors were ON at the previous generation. We start with one ON cell.
This is the Run Length Transform of the sequence 1, 6, 24, 96, 384, 1536, 6144, 24576, ... (almost certainly A164908, or 1 followed by A002023).
It appears that this is also the sequence corresponding to the odd-rule cellular automaton defined by OddRule 356 (see Ekhad-Sloane-Zeilberger "Odd-Rule Cellular Automata on the Square Grid" link). - N. J. A. Sloane, Feb 26 2015
LINKS
Shalosh B. Ekhad, N. J. A. Sloane, and Doron Zeilberger, A Meta-Algorithm for Creating Fast Algorithms for Counting ON Cells in Odd-Rule Cellular Automata, arXiv:1503.01796 [math.CO], 2015; see also the Accompanying Maple Package.
Shalosh B. Ekhad, N. J. A. Sloane, and Doron Zeilberger, Odd-Rule Cellular Automata on the Square Grid, arXiv:1503.04249 [math.CO], 2015.
N. J. A. Sloane, On the No. of ON Cells in Cellular Automata, Video of talk in Doron Zeilberger's Experimental Math Seminar at Rutgers University, Feb. 05 2015: Part 1, Part 2
N. J. A. Sloane, On the Number of ON Cells in Cellular Automata, arXiv:1503.01168 [math.CO], 2015.
FORMULA
a(n) = number of terms in expansion of f^n mod 2, where f = 1/x+x+1/y+y+1/(x*y)+x*y (mod 2);
MAPLE
C := f->`if`(type(f, `+`), nops(f), 1);
f := 1/x+x+1/y+y+1/(x*y)+x*y;
g := n->expand(f^n) mod 2;
[seq(C(g(n)), n=0..100)];
MATHEMATICA
A247640[n_] := Total[CellularAutomaton[{42, {2, {{1, 1, 0}, {1, 0, 1}, {0, 1, 1}}}, {1, 1}}, {{{1}}, 0}, {{{n}}}], 2]; Array[A247640, 54, 0] (* JungHwan Min, Sep 06 2016 *)
A247640L[n_] := Total[#, 2] & /@ CellularAutomaton[{42, {2, {{1, 1, 0}, {1, 0, 1}, {0, 1, 1}}}, {1, 1}}, {{{1}}, 0}, n]; A247640L[53] (* JungHwan Min, Sep 06 2016 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Sep 22 2014
STATUS
approved