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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A309259 a(n) is the greatest common divisor of the determinants of order n Latin squares. 1
1, 3, 18, 80, 75, 63, 196, 144, 405 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
We apply every symbol permutation on the representatives of isotopic classes to generate Latin squares of order n and calculate the determinants. We then compute the greatest common divisor of the values obtained.
These results are based upon work supported by the National Science Foundation under the grants numbered DMS-1852378 and DMS-1560019.
LINKS
Brendan McKay, Combinatorial Data
EXAMPLE
For n=4, the set of absolute values of the determinants is {0, 80, 160}, so the greatest common divisor of the determinants is 80. Therefore, a(4)=80.
PROG
(Sage) # See Peterson Lenard link
CROSSREFS
Sequence in context: A241628 A056319 A056310 * A308853 A309257 A135371
KEYWORD
nonn,hard,more
AUTHOR
EXTENSIONS
a(8), a(9) from Hugo Pfoertner, Sep 02 2019
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 09:04 EDT 2024. Contains 371240 sequences. (Running on oeis4.)