The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A112454 Lexicographically maximal solution of any 9 X 9 sudoku, read by rows. 2
 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; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS See A107739 for a definition of a sudoku. LINKS 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

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

Last modified August 11 22:58 EDT 2022. Contains 356067 sequences. (Running on oeis4.)