A255477 Number of ON cells after n generations in 4-D cellular automaton defined by 4-dimensional analog of Moore neighborhood, when started with a single ON cell at generation 0.
1, 80, 80, 624, 80, 6400, 624, 16480, 80, 6400, 6400, 49920, 624, 49920, 16480, 221888, 80, 6400, 6400, 49920, 6400, 512000, 49920, 1318400, 624, 49920, 49920, 389376, 16480, 1318400, 221888, 4245888, 80, 6400, 6400, 49920, 6400, 512000, 49920, 1318400, 6400, 512000, 512000, 3993600, 49920, 3993600, 1318400
Offset: 0
Keywords
Links
- Shalosh B. Ekhad, Details about A255477 and A255478
- 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
Comments