login
This site is supported by donations to The OEIS Foundation.

 

Logo

Invitation: celebrating 50 years of OEIS, 250000 sequences, and Sloane's 75th, there will be a conference at DIMACS, Rutgers, Oct 9-10 2014.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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. 0
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

REFERENCES

See A075462 for references.

LINKS

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

CROSSREFS

Cf. A075464.

Sequence in context: A047608 A130011 A050022 * A115375 A212114 A103650

Adjacent sequences:  A137616 A137617 A137618 * A137620 A137621 A137622

KEYWORD

hard,nonn

AUTHOR

Jacob A. Siehler, Apr 27 2008

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified September 21 11:48 EDT 2014. Contains 247025 sequences.