|
Search: id:A114288
|
|
|
| A114288 |
|
Lexicographically minimal solution of any 9 X 9 sudoku, read by rows. |
|
+0
2
|
|
| 1, 2, 3, 4, 5, 6, 7, 8, 9, 4, 5, 6, 7, 8, 9, 1, 2, 3, 7, 8, 9, 1, 2, 3, 4, 5, 6, 2, 1, 4, 3, 6, 5, 8, 9, 7, 3, 6, 5, 8, 9, 7, 2, 1, 4, 8, 9, 7, 2, 1, 4, 3, 6, 5, 5, 3, 1, 6, 4, 2, 9, 7, 8, 6, 4, 2, 9, 7, 8, 5, 3, 1, 9, 7, 8, 5, 3, 1, 6, 4, 2
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
See A107739 for definition of a sudoku.
|
|
EXAMPLE
|
1,2,3,4,5,6,7,8,9,
4,5,6,7,8,9,1,2,3,
7,8,9,1,2,3,4,5,6,
-----------------
2,1,4,3,6,5,8,9,7,
3,6,5,8,9,7,2,1,4,
8,9,7,2,1,4,3,6,5,
-----------------
5,3,1,6,4,2,9,7,8,
6,4,2,9,7,8,5,3,1,
9,7,8,5,3,1,6,4,2
|
|
CROSSREFS
|
Cf. A107739, A109741.
Adjacent sequences: A114285 A114286 A114287 this_sequence A114289 A114290 A114291
Sequence in context: A079828 A061229 A122666 this_sequence A028899 A081595 A122644
|
|
KEYWORD
|
fini,full,nonn,tabf
|
|
AUTHOR
|
Zak Seidov (zakseidov(AT)yahoo.com), Nov 21 2005; corrected Nov 23 2005
|
|
|
Search completed in 0.002 seconds
|
