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 A014385 #12 Apr 04 2020 17:41:48 %S A014385 1,1,7,157,62616,78322916,147252447227,376962851057234, %T A014385 1280344203366849969,5666901233595672365908, %U A014385 32193489258177947645878365,231605871969834571512497704231,2084558172807256752718977250960988 %N A014385 Number of connected regular bipartite graphs of degree 6 with 2n nodes. %D A014385 CRC Handbook of Combinatorial Designs, 1996, p. 648. %D A014385 I. A. Faradzev, Constructive enumeration of combinatorial objects, pp. 131-135 of Problèmes combinatoires et théorie des graphes (Orsay, 9-13 Juillet 1976). Colloq. Internat. du C.N.R.S., No. 260, Centre Nat. Recherche Scient., Paris, 1978. %H A014385 B. D. McKay and E. Rogoyski, <a href="http://www.combinatorics.org/Volume_2/volume2.html#N3">Latin squares of order ten</a>, Electron. J. Combinatorics, 2 (1995) #N3. %Y A014385 Column k=6 of A008326. %K A014385 nonn,hard %O A014385 6,3 %A A014385 _N. J. A. Sloane_ %E A014385 More terms from Eric Rogoyski, May 15 1997 %E A014385 a(12)-a(18) from _Andrew Howroyd_, Apr 04 2020