login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A274171 Number of diagonal Latin squares of order n with first row 1..n. 1
1, 0, 0, 2, 8, 128, 171200, 7447587840, 5056994653507584 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

LINKS

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

S. E. Kochemazov, E. I. Vatutin, O. S. Zaikin, Fast Algorithm for Enumerating Diagonal Latin Squares of Small Order, arXiv:1709.02599 [math.CO], 2017.

E. I. Vatutin, S. E. Kochemazov, O. S. Zaikin, Applying Volunteer and Parallel Computing for Enumerating Diagonal Latin Squares of Order 9, Parallel Computational Technologies. PCT 2017. Communications in Computer and Information Science, vol. 753, pp. 114-129. doi: 10.1007/978-3-319-67035-5_9

E. I. Vatutin, O. S. Zaikin, A. D. Zhuravlev, M. O. Manzuk, S. E. Kochemazov and V. S. Titov, Using grid systems for enumerating combinatorial objects on example of diagonal Latin squares. Proceedings of Distributed Computing and grid-technologies in science and education (GRID'16), JINR, Dubna, 2016, pp. 114-115.

Vatutin E. I., Zaikin O. S., Zhuravlev A. D., Manzuk M. O., Kochemazov S. E., Titov V. S., The effect of filling cells order to the rate of generation of diagonal Latin squares. Information-measuring and diagnosing control systems (Diagnostics - 2016). Kursk: SWSU, 2016. pp. 33-39. (in Russian)

E. I. Vatutin, V. S. Titov, O. S. Zaikin, S. E. Kochemazov, S. U. Valyaev, A. D. Zhuravlev, M. O. Manzuk, Using grid systems for enumerating combinatorial objects with example of diagonal Latin squares, Information technologies and mathematical modeling of systems (2016), pp. 154-157. (in Russian)

Eduard I. Vatutin, a(9) value fixed after

Vatutin E.I., Zaikin O.S., Zhuravlev A.D., Manzyuk M.O., Kochemazov S.E., Titov V.S., Using grid systems for enumerating combinatorial objects on example of diagonal Latin squares. CEUR Workshop proceedings. Selected Papers of the 7th International Conference Distributed Computing and Grid-technologies in Science and Education. 2017. Vol. 1787. pp. 486-490. urn:nbn:de:0074-1787-5.

Index entries for sequences related to Latin squares and rectangles

FORMULA

a(n) = A274806(n)/n!.

CROSSREFS

Cf. A000315, A000479.

Sequence in context: A111179 A178173 A058891 * A184945 A058343 A267407

Adjacent sequences:  A274168 A274169 A274170 * A274172 A274173 A274174

KEYWORD

nonn,more

AUTHOR

Eduard I. Vatutin, Jul 07 2016

EXTENSIONS

a(9) added from Vatutin et al. (2016) by Max Alekseyev, Oct 05 2016

a(9) corrected by Eduard I. Vatutin, Oct 20 2016

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified December 15 14:45 EST 2017. Contains 296040 sequences.