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

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

Offset

1,1

Comments

See A107739 for a definition of a sudoku.

Links

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

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: A061601 A098756 A267193 * A304621 A138531 A030076

Adjacent sequences: A112451 A112452 A112453 * A112455 A112456 A112457

Keyword

fini,full,nonn,tabf

Author

Chris Deugau (deugaucj(AT)uvic.ca), Dec 13 2005

Status

approved