A014387 Number of connected regular bipartite graphs of degree 7 with 2n nodes.

1, 1, 8, 725, 2806508, 27033154065, 376962851057235, 7292080848843162283, 192271946945501178473766, 6811960423672201527406129366, 320020341797819074616734725607588, 19688392653216509161510863093984500501

Offset: 7

Author

N. J. A. Sloane

Keywords

• nonn
• hard

References

• 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.
• CRC Handbook of Combinatorial Designs, 1996, p. 648.

Links

• B. D. McKay and E. Rogoyski, Latin squares of order ten, Electron. J. Combinatorics, 2 (1995) #N3.

Crossrefs

Column k=7 of A008326.

Extensions

More terms from Eric Rogoyski, May 15 1997

a(12)-a(18) from Andrew Howroyd, Apr 04 2020