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,2

References

See A075462 for references.

Links

Table of n, a(n) for n=1..29.

Crossrefs

Cf. A075464.

Sequence in context: A308783 A130011 A050022 * A115375 A212114 A269227

Adjacent sequences: A137616 A137617 A137618 * A137620 A137621 A137622

Keyword

hard,nonn

Author

Jacob A. Siehler, Apr 27 2008

Status

approved