OFFSET
1,1
COMMENTS
Klaus Sutner, Jun 26 2006, remarks that it can be shown that this sequence is infinite.
REFERENCES
Dieter Gebhardt, "Cross pattern puzzles revisited," Cubism For Fun 69 (March 2006), 23-25.
LINKS
K. Sutner, Linear cellular automata and the Garden-of-Eden, Math. Intelligencer, 11 (No. 2, 1989), 49-53.
K. Sutner, The computational complexity of cellular automata, in Lect. Notes Computer Sci., 380 (1989), 451-459.
K. Sutner, sigma-Automata and Chebyshev-polynomials, Theoretical Comp. Sci., 230 (2000), 49-73.
M. Hunziker, A. Machiavelo and J. Park, Chebyshev polynomials over finite fields and reversibility of sigma-automata on square grids, Theoretical Comp. Sci., 320 (2004), 465-483.
Eric Weisstein's World of Mathematics, Lights-Out Puzzle
CROSSREFS
KEYWORD
nonn,hard,more
AUTHOR
Ralf Stephan, May 22 2004
EXTENSIONS
Gebhardt and Sutner references from Don Knuth, May 11 2006
STATUS
approved