id:A137619 - OEIS Search Results

Search: id:A137619

Displaying 1-1 of 1 results found.

page 1

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

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; listen)

	OFFSET	`1,2`
	REFERENCES	`See A075462 for references.`
	CROSSREFS	`Cf. A075464.` `Sequence in context: A047608 A130011 A050022 this_sequence A115375 A103650 A131116` `Adjacent sequences: A137616 A137617 A137618 this_sequence A137620 A137621 A137622`
	KEYWORD	`hard,nonn`
	AUTHOR	`Jacob A. Siehler (siehlerj(AT)wlu.edu), Apr 27 2008`

page 1

Search completed in 0.002 seconds

Last modified December 3 01:16 EST 2008. Contains 151161 sequences.

AT&T Labs Research