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 A006825 M3679 #18 Apr 03 2020 21:54:13 %S A006825 1,1,4,41,1981,304495,78322915,27033154060,11934777413004, %T A006825 6593485023087880,4485517185017428244,3707462300996566329965, %U A006825 3680029088808677189795063,4341813441626419937873317841,6033239205199247162872884404386,9792722283774374706204648839780148 %N A006825 Number of connected regular bipartite graphs of degree 5 with 2n nodes. %D A006825 CRC Handbook of Combinatorial Designs, 1996, p. 648. %D A006825 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. %D A006825 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). %H A006825 M. Meringer, <a href="http://www.mathe2.uni-bayreuth.de/markus/reggraphs.html">Tables of Regular Graphs</a> %H A006825 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. %F A006825 Inverse Euler transform of A333731. - _Andrew Howroyd_, Apr 03 2020 %Y A006825 Column 5 of A008326. %Y A006825 Cf. A006823, A006824, A333731. %K A006825 nonn,hard %O A006825 5,3 %A A006825 _N. J. A. Sloane_ %E A006825 More terms from Eric Rogoyski, May 15 1997 %E A006825 Terms a(12) and beyond from _Andrew Howroyd_, Apr 03 2020