cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A345760 a(n) is the number of distinct numbers of intercalates of order n diagonal Latin squares.

Original entry on oeis.org

0, 0, 0, 1, 2, 1, 21, 61, 64
Offset: 1

Views

Author

Eduard I. Vatutin, Jun 26 2021

Keywords

Comments

a(n) <= A307164(n) - A307163(n) + 1.
a(n) <= A287764(n).
a(10) >= 98, a(11) >= 145, a(12) >= 259, a(13) >= 200, a(14) >= 362, a(15) >= 536, a(16) >= 792, a(17) >= 685, a(18) >= 535, a(19) >= 447, a(20) >= 1011, a(21) >= 747, a(22) >= 872, a(23) >= 885, a(24) >= 1610, a(25) >= 1677, a(26) >= 1266, a(27) >= 1337, a(28) >= 2795. - Eduard I. Vatutin, Oct 02 2021, updated Mar 02 2025

Examples

			For n=7 the number of intercalates that a diagonal Latin square of order 7 may have is 0, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 18, 20, 22, 26, or 30. Since there are 21 distinct values, a(7)=21.
		

Crossrefs

Extensions

a(9) added by Eduard I. Vatutin, Oct 22 2022