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.
%I A000952 M1574 N0615 #53 Jul 25 2023 23:32:24
%S A000952 2,6,10,14,18,26,30,38,42,46,50,54,62
%N A000952 Numbers k == 2 (mod 4) that are the orders of conference matrices.
%C A000952 A conference matrix of order k is a k X k {-1,0,+1} matrix A such that A A' = (k-1)I.
%C A000952 If k == 2 (mod 4) then a necessary condition is that k-1 is a sum of 2 squares (A286636). It is conjectured that this condition is also sufficient. If k == 2 (mod 4) and k-1 is a prime or prime power the condition is automatically satisfied.
%D A000952 V. Belevitch, Conference matrices and Hadamard matrices, Ann. Soc. Scientifique Bruxelles, 82 (I) (1968), 13-32.
%D A000952 CRC Handbook of Combinatorial Designs, 1996, Chapter 52.
%D A000952 F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, Elsevier-North Holland, 1978, p. 56.
%D A000952 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
%D A000952 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A000952 Joerg Arndt, <a href="/A000952/a000952.txt">Some relevant PARI/GP programs</a>
%H A000952 N. A. Balonin and Jennifer Seberry, <a href="https://ro.uow.edu.au/eispapers/2748">A review and new symmetric conference matrices</a>, 2014.
%H A000952 Nikolay Balonin, Mikhail Sergeev and Anton Vostrikov, <a href="https://doi.org/10.31799/1684-8853-2020-2-2-9">Prime Fermat numbers and maximum determinant matrix conjecture</a>, Information and Control Systems (2020) No. 2, 2-9. (Abstract in Russian, English translation available on page)
%H A000952 Wikipedia, <a href="https://en.wikipedia.org/wiki/Conference_matrix">Conference matrix</a>.
%e A000952 The essentially unique conference matrix of order 6:
%e A000952 0 +1 +1 +1 +1 +1
%e A000952 +1 0 +1 -1 -1 +1
%e A000952 +1 +1 0 +1 -1 -1
%e A000952 +1 -1 +1 0 +1 -1
%e A000952 +1 -1 -1 +1 0 +1
%e A000952 +1 +1 -1 -1 +1 0
%Y A000952 Subsequence of A016825.
%Y A000952 Cf. A286636.
%K A000952 nonn,hard,more,nice
%O A000952 1,1
%A A000952 _N. J. A. Sloane_
%E A000952 66 seems to be the smallest order for which it is not known whether a conference matrix exists. Since 65 is the sum of two squares, according to the conjecture, 66 should be the next term.
%E A000952 Edited by _N. J. A. Sloane_, Mar 13 2008, Mar 16 2008, May 22 2014