cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-3 of 3 results.

A107739 Number of (completed) sudokus (or Sudokus) of size n^2 X n^2.

Original entry on oeis.org

1, 1, 288, 6670903752021072936960
Offset: 0

Views

Author

Richard McNair (rmcnair(AT)ntlworld.com), Jun 11 2005

Keywords

Comments

An n^2 X n^2 sudoku is an n^2 X n^2 array which is subdivided into n^2 n X n subarrays. Each row and column of the full array must contain each of the numbers 1 ... n^2 exactly once (this makes it a Latin square of order n^2). In addition, each of the n^2 n X n subarrays must also contain each of the numbers 1 ... n^2 exactly once.

Examples

			Comment from _Hugo van der Sanden_, Jun 12 2005: "Consider n=2: renumbering doesn't affect the result, so we can fix row A at (1, 2, 3, 4) and multiply the result by 4!. Once rows B and C are chosen, there is only one option for row D. Row B must have (3, 4) or (4, 3) followed by (1, 2) or (2, 1).
"Rows C and D can be swapped without affecting validity, so we can fix column 1 of row C to be the lower of the two options and multiply the results by 2.
"That leaves at most 4 options for row C (2 choices in each of the remaining 3 positions, of which one must have our selected number as one of the choices); that leaves 16 options to check for rows B and C, the result to be multiplied by 48.
"Checking, we find just 6 of the 16 grids are valid:
1234/3412/2143/4321 1234/3412/2341/4123 1234/3421/2143/4312
1234/4312/2143/3421 1234/4321/2143/3412 1234/4321/2413/3142
so a(2) = 6 * 48 = 288."
An example of a sudoku of size 9 X 9:
  1 2 4 | 5 6 7 | 8 9 3
  3 7 8 | 2 9 4 | 5 1 6
  6 5 9 | 8 3 1 | 7 4 2
  ------+-------+------
  9 8 7 | 1 2 3 | 4 6 5
  2 3 1 | 4 5 6 | 9 7 8
  5 4 6 | 7 8 9 | 3 2 1
  ------+-------+------
  8 6 3 | 9 7 2 | 1 5 4
  4 9 5 | 6 1 8 | 2 3 7
  7 1 2 | 3 4 5 | 6 8 9
See A114288 for the lexicographically earliest 9 x 9 solution, which is the analog of the first of the 4 x 4 grids given at the end of van der Sanden's comment. - _M. F. Hasler_, Mar 29 2013
		

References

  • K. Ying Lin, "Number Of Sudokus" in 'Journal of Recreational Mathematics' pp. 120-4 Vol.33 No. 2 2004-5 Baywood Pub. Amityville NY.
  • Surendra Verma, The Little Book of Maths Theorems, Theories & Things, New Holland Publishers (Australia) Pty Ltd., Sydney, page 135, 2008.

Crossrefs

Extensions

Entry revised by N. J. A. Sloane, Aug 12 2005
Thanks to Emiliano Venturini (il_wentu(AT)excite.com), for some corrections to the comments, Apr 08 2006

A285178 Number of n^2 X n^2 S-permutation matrices that are disjoint from a given one.

Original entry on oeis.org

0, 7, 17972, 41685061617, 232152032603580176504, 7236273578711450275537707547657855
Offset: 1

Views

Author

N. J. A. Sloane, Apr 14 2017

Keywords

Comments

Note that although the two Yordzhev papers have similar titles, they are different papers.

Crossrefs

A285179 Number of disjoint non-ordered pairs of n^2 X n^2 S-permutation matrices.

Original entry on oeis.org

0, 56, 419250816, 2294248126968596791296, 71871209790288983974921874964480000000000, 70222282105561329499166350697268240329817049897201827840000000000000
Offset: 1

Views

Author

N. J. A. Sloane, Apr 14 2017

Keywords

Comments

Note that although the two Yordzhev papers have similar titles, they are different papers.

Crossrefs

Formula

a(n) = A285178(n)*(n!)^(2*n)/2.
Showing 1-3 of 3 results.