A255297 Number of ON cells after n generations of the odd-rule cellular automaton defined by OddRule 035 when started with a single ON cell.

1, 4, 4, 14, 4, 16, 14, 46, 4, 16, 16, 56, 14, 56, 46, 146, 4, 16, 16, 56, 16, 64, 56, 184, 14, 56, 56, 196, 46, 184, 146, 454, 4, 16, 16, 56, 16, 64, 56, 184, 16, 64, 64, 224, 56, 224, 184, 584, 14, 56, 56, 196, 56, 224, 196, 644, 46, 184, 184, 644

Offset: 0

Author

N. J. A. Sloane and Doron Zeilberger, Feb 23 2015

Keywords

• nonn

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, 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.
• Index entries for sequences related to cellular automata

Crossrefs

Cf. A027649.

Programs

Mathematica

a27649[n_] := 2(3^n) - 2^n;
Table[Times @@ (a27649[Length[#]]&) /@ Select[Split[IntegerDigits[n, 2]], #[[1]] == 1&], {n, 0, 59}] (* Jean-François Alcover, Sep 15 2018 *)

Formula

Run length transform of A027649.