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