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
1, 1, 8, 725, 2806508 (list; graph; refs; listen; history; text; internal format)
OFFSET

7,3

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

Table of n, a(n) for n=7..11.

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

CROSSREFS

Sequence in context: A221198 A071308 A046188 * A220641 A017007 A268250

Adjacent sequences:  A014384 A014385 A014386 * A014388 A014389 A014390

KEYWORD

nonn,hard

AUTHOR

N. J. A. Sloane

EXTENSIONS

More terms from Eric Rogoyski, May 15 1997

STATUS

approved

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 June 25 10:10 EDT 2019. Contains 324351 sequences. (Running on oeis4.)