A253064 Number of odd terms in f^n, where f = 1/x + 1 + x + y.

1, 4, 4, 12, 4, 16, 12, 40, 4, 16, 16, 48, 12, 48, 40, 128, 4, 16, 16, 48, 16, 64, 48, 160, 12, 48, 48, 144, 40, 160, 128, 416, 4, 16, 16, 48, 16, 64, 48, 160, 16, 64, 64, 192, 48, 192, 160, 512, 12, 48, 48, 144, 48, 192, 144, 480, 40, 160, 160, 480, 128, 512, 416

Offset

0,2

Comments

This is the number of ON cells in a certain 2-D CA in which the neighborhood of a cell is defined by f, and in which a cell is ON iff there was an odd number of ON cells in the neighborhood at the previous generation.

This is the odd-rule cellular automaton defined by OddRule 017 (see Ekhad-Sloane-Zeilberger "Odd-Rule Cellular Automata on the Square Grid" link). - N. J. A. Sloane, Feb 25 2015

Links

Alois P. Heinz, Table of n, a(n) for n = 0..8191

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, 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, 2015.

Po-Yi Huang and Wen-Fong Ke, Sequences Derived from The Symmetric Powers of {1,2,...,k}, arXiv:2307.07733 [math.CO], 2023.

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, 2015

Index entries for sequences related to cellular automata

Formula

This is the Run Length Transform of A087206.

Example

Here is the neighborhood f:
[0, X, 0]
[X, X, X]
which contains a(1) = 4 ON cells.

Maple

C:=f->subs({x=1, y=1}, f);
# Find number of ON cells in CA for generations 0 thru M defined by rule
# that cell is ON iff number of ON cells in nbd at time n-1 was odd
# where nbd is defined by a polynomial or Laurent series f(x, y).
OddCA:=proc(f, M) global C; local n, a, i, f2, p;
f2:=simplify(expand(f)) mod 2;
a:=[]; p:=1;
for n from 0 to M do a:=[op(a), C(p)]; p:=expand(p*f2) mod 2; od:
lprint([seq(a[i], i=1..nops(a))]);
end;
f:=1/x+1+x+y;
OddCA(f, 130);

Mathematica

f[n_] := 2^n*Fibonacci[n+2]; Table[Times @@ (f[Length[#]]&) /@ Select[ Split[ IntegerDigits[n, 2]], #[[1]] == 1&], {n, 0, 62}] (* Jean-François Alcover, Jul 11 2017 *)

Crossrefs

Other CA's that use the same rule but with different cell neighborhoods: A160239, A102376, A071053, A072272, A001316, A246034, A246035.

Cf. A087206.

Sequence in context: A256251 A256139 A328854 * A109045 A079315 A229253

Adjacent sequences: A253061 A253062 A253063 * A253065 A253066 A253067

Keyword

nonn

Author

N. J. A. Sloane, Jan 26 2015

Status

approved