OFFSET
0,2
COMMENTS
A253065 is the Run Length Transform of this sequence.
LINKS
Colin Barker, Table of n, a(n) for n = 0..1000
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.
Index entries for linear recurrences with constant coefficients, signature (1,5,13,6,8).
FORMULA
G.f.: (1+2*x)*(1+2*x+3*x^2+4*x^3)/(1-x-5*x^2-13*x^3-6*x^4-8*x^5).
Examination of the roots of the denominator shows that the ratio of successive terms approaches 3.5849301...
MAPLE
OddCA2:=proc(f, M) local n, a, i, f2, g, p;
f2:=simplify(expand(f)) mod 2;
p:=1; g:=f2;
for n from 1 to M do p:=expand(p*g) mod 2; print(n, nops(p)); g:=expand(g^2) mod 2; od:
return;
end;
f24:=1/x+1+x+x/y+x*y;
OddCA2(f24, 8);
MATHEMATICA
LinearRecurrence[{1, 5, 13, 6, 8}, {1, 5, 17, 65, 229}, 26] (* Jean-François Alcover, Nov 23 2017 *)
PROG
(PARI) Vec(-(2*x+1)*(4*x^3+3*x^2+2*x+1)/(8*x^5+6*x^4+13*x^3+5*x^2+x-1) + O(x^30)) \\ Colin Barker, Jul 16 2015
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, Jan 27 2015
STATUS
approved