login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A091323 Minimum number of transversals in a Latin square of order 2n+1. 3
1, 3, 3, 3, 68 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

Ryser conjectured that a(n) >= 1 for all n. For even orders the number is 0, since the group table for Z_2n has no transversals.

REFERENCES

H. J. Ryser, Neuere Probleme der Kombinatorik. Vortraege ueber Kombinatorik, Oberwolfach, 1967, Mathematisches Forschungsinstitut Oberwolfach, pp. 69-91.

LINKS

Table of n, a(n) for n=0..4.

B. D. McKay, J. C. McLeod and I. M. Wanless, The number of transversals in a Latin square, Des. Codes Cryptogr., 40, (2006) 269-284.

V. N. Potapov, On the number of transversals in Latin squares, arxiv:1506.01577 [math.CO], 2015.

Index entries for sequences related to Latin squares and rectangles

CROSSREFS

Cf. A090741, A092237.

Sequence in context: A135584 A174538 A340821 * A174641 A217671 A118539

Adjacent sequences:  A091320 A091321 A091322 * A091324 A091325 A091326

KEYWORD

nonn,hard,more

AUTHOR

Richard Bean, Feb 17 2004

EXTENSIONS

a(4) from Brendan McKay and Ian Wanless, May 23 2004

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
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 6 22:42 EST 2021. Contains 349567 sequences. (Running on oeis4.)