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 A065711 #16 Oct 25 2022 10:21:33 %S A065711 1,-1,4,-24,2304,368640,6210846720,2086844497920,27369126116720640000 %N A065711 The Alon-Tarsi constants AT(n). %C A065711 The extended Alon-Tarsi conjecture states AT(n)<>0 for every positive integer n. Several cases have been proved - see references. %H A065711 Jochem Berndsen, <a href="https://research.tue.nl/en/studentTheses/three-problems-in-algebraic-combinatorics">Three problems in algebraic combinatorics</a>, Student thesis: Master, Eindhoven University of Technology, 2012. %H A065711 A. Drisko, <a href="https://doi.org/10.37236/1366">Proof of the Alon-Tarsi Conjecture for n=(2^r)*p</a>, Electronic Journal of Combinatorics, Volume 5 (1998). %H A065711 David G. Glynn, <a href="https://doi.org/10.1137/090773751">The Conjectures of Alon-Tarsi and Rota in Dimension Prime Minus One</a>, SIAM Journal on Discrete Mathematics, 24 (2010), 394-399. %H A065711 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Alon-TarsiConjecture.html">Alon-Tarsi Conjecture</a> %H A065711 P. Zappa, <a href="https://doi.org/10.1006/aama.1996.0522">The Cayley determinant of the determinant tensor and the Alon-Tarsi conjecture</a>, Advances in Applied Mathematics, 19 (1997), 31-44. [Contains an error: see Glynn.] %F A065711 AT(n)=(fdels(n)-fdols(n))/(n-1)!, where fdels(n) and fdols(n) are the numbers of fixed diagonal even and fixed diagonal odd Latin squares, respectively. %Y A065711 Cf. A114631 (fdels), A114632 (fdols). %K A065711 hard,sign,more %O A065711 2,3 %A A065711 Jan Siwanowicz (jansiwanowicz(AT)yahoo.com), Dec 04 2001 %E A065711 Terms a(9) and a(10) added by _Jochem Berndsen_, Jun 05 2012