A255458 Number of ON cells after n generations of the odd-rule cellular automaton defined by OddRule 255 when started with a single ON cell.
1, 5, 5, 25, 5, 25, 25, 101, 5, 25, 25, 125, 25, 125, 101, 361, 5, 25, 25, 125, 25, 125, 125, 505, 25, 125, 125, 625, 101, 505, 361, 1205, 5, 25, 25, 125, 25, 125, 125, 505, 25, 125, 125, 625, 125, 625, 505, 1805, 25, 125, 125, 625, 125, 625, 625, 2525, 101, 505, 505, 2525
Offset: 0
Keywords
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
- Index entries for sequences related to cellular automata
Crossrefs
Run length transform of A255459.