login

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A342998
Minimum number of diagonal transversals in a cyclic diagonal Latin square of order 2n+1.
6
1, 0, 5, 27, 0, 4523, 128818, 0, 204330233, 11232045257
OFFSET
0,3
COMMENTS
A cyclic Latin square is a Latin square in which row i is obtained by cyclically shifting row i-1 by d places (see A338562, A123565 and A341585).
Cyclic diagonal Latin squares do not exist for even orders.
a(n) <= A342997(n).
All cyclic diagonal Latin squares are diagonal Latin squares, so A287647(n) <= a((n-1)/2).
EXAMPLE
For n=2 one of best cyclic diagonal Latin squares of order 5
0 1 2 3 4
2 3 4 0 1
4 0 1 2 3
1 2 3 4 0
3 4 0 1 2
has a(2)=5 diagonal transversals:
0 . . . . . 1 . . . . . 2 . . . . . 3 . . . . . 4
. . 4 . . . . . 0 . . . . . 1 2 . . . . . 3 . . .
. . . . 3 4 . . . . . 0 . . . . . 1 . . . . . 2 .
. 2 . . . . . 3 . . . . . 4 . . . . . 0 1 . . . .
. . . 1 . . . . . 2 3 . . . . . 4 . . . . . 0 . .
KEYWORD
nonn,more,hard
AUTHOR
Eduard I. Vatutin, Apr 02 2021
STATUS
approved