MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I would like to ask about the game Lights Out for a square nxn. In there is a list of the number of solutions to the game, and the number of solutions modulo symmetries of the square. Somewhere I have seen a formula for the number of solutions for general n, written as a generating function. However I cannot locate it now. Does anyone know where it is? And is there also a formula for the number of solutions modulo symmetries for general n? Thanks

share|cite|improve this question
See also the earlier MO question, Randomly switching street lights, in a square city, concerning "Berlekamp’s Switching Game." – Joseph O'Rourke Feb 12 '14 at 15:55

The number of solutions to the all-ones lights out problem on an $n\times n$ square, where nonidentical reflected and rotated solutions are considered distinct. (The link gives the Mathematica code to generate the sequence.)

Similarly, gives the number of rotation-reflection inequivalent solutions.

share|cite|improve this answer
My question is to find a closed formula (explicit formula or as a generating function) for these numbers, not just an algorithm to compute them one by one. – Vicente Munoz Feb 12 '14 at 19:43
If there's no formula at the oeis pages, that's evidence that nobody has found one. But did you follow up on all the links at the oeis pages? – Gerry Myerson Feb 12 '14 at 22:16

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.