id:A112454 - OEIS Search Results

Search: id:A112454

Displaying 1-1 of 1 results found.

page 1

Lexicographically maximal solution of any 9 X 9 sudoku, read by rows.

+0
1

9, 8, 7, 6, 5, 4, 3, 2, 1, 6, 5, 4, 3, 2, 1, 9, 8, 7, 3, 2, 1, 9, 8, 7, 6, 5, 4, 8, 9, 6, 7, 4, 5, 2, 1, 3, 7, 4, 5, 2, 1, 3, 8, 9, 6, 2, 1, 3, 8, 9, 6, 7, 4, 5, 5, 7, 9, 4, 6, 8, 1, 3, 2, 4, 6, 8, 1, 3, 2, 5, 7, 9, 1, 3, 2, 5, 7, 9, 4, 6, 8 (list; graph; listen)

	OFFSET	`1,1`
	COMMENT	`See A107739 for a definition of a sudoku.`
	EXAMPLE	`9 8 7\|6 5 4\|3 2 1` `6 5 4\|3 2 1\|9 8 7` `3 2 1\|9 8 7\|6 5 4` `-----------------` `8 9 6\|7 4 5\|2 1 3` `7 4 5\|2 1 3\|8 9 6` `2 1 3\|8 9 6\|7 4 5` `-----------------` `5 7 9\|4 6 8\|1 3 2` `4 6 8\|1 3 2\|5 7 9` `1 3 2\|5 7 9\|4 6 8`
	CROSSREFS	`Cf. A107739, A109741, A114288.` `Sequence in context: A084019 A061601 A098756 this_sequence A138531 A030076 A083824` `Adjacent sequences: A112451 A112452 A112453 this_sequence A112455 A112456 A112457`
	KEYWORD	`fini,full,nonn`
	AUTHOR	`Chris Deugau (deugaucj(AT)uvic.ca), Dec 13 2005`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research