login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A014387 Number of connected regular bipartite graphs of degree 7 with 2n nodes. 0

%I

%S 1,1,8,725,2806508

%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.

%K nonn,hard

%O 7,3

%A _N. J. A. Sloane_

%E More terms from Eric Rogoyski, May 15 1997

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 15 16:29 EDT 2019. Contains 325049 sequences. (Running on oeis4.)