[go: up one dir, main page]

login
A255449
a(n) = A255448(2^n-1).
1
1, 5, 19, 71, 257, 925, 3323, 11919, 42729, 153173, 549075, 1968247, 7055601, 25292621, 90668587, 325028895, 1165167673, 4176914949, 14973497539, 53677355783, 192423938625, 689806295677, 2472835597211, 8864685923631, 31778359388937, 113919900383925, 408383064188083, 1463982386475159
OFFSET
0,2
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, 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, 2015
FORMULA
G.f.: (1-x)*(1-x^2-2*x^3-6*x^4)/(1-6*x+10*x^2-8*x^3+15*x^4-10*x^5-10*x^6).
CROSSREFS
Cf. A255448.
Sequence in context: A222538 A095073 A128349 * A296630 A001834 A099393
KEYWORD
nonn
AUTHOR
STATUS
approved