|
%I #12 Apr 04 2020 17:42:17
%S 1,1,8,725,2806508,27033154065,376962851057235,7292080848843162283,
%T 192271946945501178473766,6811960423672201527406129366,
%U 320020341797819074616734725607588,19688392653216509161510863093984500501
%N Number of connected regular bipartite graphs of degree 7 with 2n nodes.
%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 CRC Handbook of Combinatorial Designs, 1996, p. 648.
%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.
%Y Column k=7 of A008326.
%K nonn,hard
%O 7,3
%A _N. J. A. Sloane_
%E More terms from Eric Rogoyski, May 15 1997
%E a(12)-a(18) from _Andrew Howroyd_, Apr 04 2020
|
