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!)
A342997 Maximum number of diagonal transversals in a cyclic diagonal Latin square of order 2n+1. 5
1, 0, 5, 27, 0, 4665, 131106, 0, 204995269, 11254190082 (list; graph; refs; listen; history; text; internal format)
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 n.
All cyclic diagonal Latin squares are diagonal Latin squares, so a((n-1)/2) <= A287648(n).
All diagonal transversals are transversals, so a(n) <= A006717(n).
A342998 <= a(n).
LINKS
EXAMPLE
For n=2 one of the 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 . .
CROSSREFS
Sequence in context: A180928 A366332 A342998 * A118391 A196085 A097088
KEYWORD
nonn,more,hard
AUTHOR
Eduard I. Vatutin, Apr 02 2021
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 April 19 06:44 EDT 2024. Contains 371782 sequences. (Running on oeis4.)