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

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

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: A266725 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

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

License Agreements, Terms of Use, Privacy Policy .

Last modified December 8 19:05 EST 2016. Contains 278948 sequences.