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.

A287649 Number of horizontally symmetric diagonal Latin squares of order 2n with the first row in ascending order.

Original entry on oeis.org

0, 2, 64, 3612672, 82731715264512
Offset: 1

Views

Author

Eduard I. Vatutin, May 29 2017

Keywords

Comments

The number of horizontally symmetric diagonal Latin squares (X) is equal to the number of vertically symmetric diagonal Latin squares. The total number of diagonal Latin squares with either horizontal or vertical symmetry (see A296060) is equal to 2*X-Y, where Y is the number of doubly symmetric diagonal Latin squares (see A287650). - Eduard I. Vatutin, Alexey D. Belyshev, Oct 09 2017
The sum of symmetric elements a[i, j] and a[i, n-1-j] in a horizontally symmetric normalized square of order n is constant and equal to n-1 for all pairs of elements (with rows and columns numbered from 0 to n-1 and elements values from 0 to n-1). This is not true for vertically symmetric normalized squares. - Eduard I. Vatutin, Oct 19 2017

Examples

			Horizontally symmetric diagonal Latin square:
  0 1 2 3 4 5
  4 2 0 5 3 1
  5 4 3 2 1 0
  2 5 4 1 0 3
  3 0 1 4 5 2
  1 3 5 0 2 4
Vertically symmetric diagonal Latin square:
  0 1 2 3 4 5
  4 2 5 0 3 1
  3 5 1 2 0 4
  5 3 0 4 1 2
  2 4 3 1 5 0
  1 0 4 5 2 3
		

Crossrefs

Formula

a(n) = A292516(n) / (2*n)!.
a(n) = (A296060(n) + A287650(n/2))/2 for even n; a(n) = A296060(n)/2 for odd n. - Andrew Howroyd, May 28 2021

Extensions

a(5) calculated and added by Eduard I. Vatutin, S. E. Kochemazov and O. S. Zaikin, Jun 15 2017