A137619 a(n) is the maximal (nonredundant) number of switch flippings in a solution of the all-ones lights out problem on an n X n square.

1, 4, 5, 12, 15, 28, 33, 40, 55, 44, 71, 72, 105, 96, 117, 152, 147, 188, 225, 224, 245, 276, 299, 306, 353, 356, 405, 416, 451

Offset: 1

Author

Jacob A. Siehler, Apr 27 2008

Keywords

• hard
• nonn

References

• See A075462 for references.

Crossrefs

Cf. A075464.