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

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

Offset

1,2

Comments

See A107739 for definition of a sudoku.

Links

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

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

Prog

(PARI) A114288(m=3, n=3)={my(A=Mat([1..m*n]), L); for(i=2, m*n, A=matconcat([A; vector(#A, j, if(i%m!=1, A[i-1, (j-1+n)%#A+1], j>1||L=A[1, ]; L=setminus(L, [j=setminus(L, Set(A[, j]))[1+(i==n+1&&j==m*n-1)]]); j))])); A} \\ Also allows to produce minimal sudokus of other sizes, e.g., 2x3 or 3x2. - M. F. Hasler, Nov 09 2021

Crossrefs

Cf. A107739, A109741.

Sequence in context: A079828 A061229 A122666 * A028899 A081595 A122644

Adjacent sequences: A114285 A114286 A114287 * A114289 A114290 A114291

Keyword

fini,full,nonn,tabf

Author

Zak Seidov, Nov 21 2005; corrected Nov 23 2005

Status

approved