|
|
A001438
|
|
Maximal number of mutually orthogonal Latin squares (or MOLS) of order n.
|
|
4
|
|
|
|
OFFSET
|
2,2
|
|
COMMENTS
|
By convention, a(0) = a(1) = infinity.
Parker and others conjecture that a(10) = 2.
It is also known that a(11) = 10, a(12) >= 5.
It is known that a(n) >= 2 for all n > 6, disproving a conjecture by Euler that a(4k+2) = 1 for all k. - Jeppe Stig Nielsen, May 13 2020
|
|
REFERENCES
|
CRC Handbook of Combinatorial Designs, 1996, pp. 113ff.
S. Hedayat, N. J. A. Sloane and J. Stufken, Orthogonal Arrays, Springer-Verlag, NY, 1999, Chapter 8.
E. T. Parker, Attempts for orthogonal latin 10-squares, Abstracts Amer. Math. Soc., Vol. 12 1991 #91T-05-27.
David Wells, The Penguin Dictionary of Curious and Interesting Numbers, Penguin Books, 1997, p. 58.
|
|
LINKS
|
|
|
FORMULA
|
a(n) <= n-1 for all n>1. - Tom Edgar, Apr 27 2015
a(p^k) = p^k-1 for all primes p and k>0. - Tom Edgar, Apr 27 2015
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,hard,more,nice
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|