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.

A382272 Maximum number of orthogonal diagonal Latin squares with the first row in ascending order that can be orthogonal to a given Brown's diagonal Latin square of order 2n.

This page as a plain text file.
%I A382272 #6 Mar 27 2025 20:22:42
%S A382272 0,1,0,824,8
%N A382272 Maximum number of orthogonal diagonal Latin squares with the first row in ascending order that can be orthogonal to a given Brown's diagonal Latin square of order 2n.
%C A382272 A Brown's diagonal Latin square is a horizontally symmetric row-inverse or vertically symmetric column-inverse diagonal Latin square (see A339641).
%C A382272 Brown's diagonal Latin squares are special case of plain symmetry diagonal Latin squares that do not exist for odd orders.
%C A382272 a(6)>=1764493860.
%H A382272 Eduard I. Vatutin, <a href="https://vk.com/wall162891802_2895">About the spectra of numerical characteristics of Brown's diagonal Latin squares</a> (in Russian).
%H A382272 Eduard I. Vatutin, <a href="/A382272/a382272.txt">Proving list (best known examples)</a>.
%H A382272 <a href="/index/La#Latin">Index entries for sequences related to Latin squares and rectangles</a>.
%Y A382272 Cf. A287695, A339641.
%K A382272 nonn,more,hard
%O A382272 1,4
%A A382272 _Eduard I. Vatutin_, Mar 20 2025