Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A014387
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A014387 Number of connected regular bipartite graphs of degree 7 with 2n nodes. +0
1
1, 1, 8, 725, 2806508 (list; graph; listen)
OFFSET

7,3

REFERENCES

I. A. Faradzev, Constructive enumeration of combinatorial objects, pp. 131-135 of Probl\`{e}mes combinatoires et th\'{e}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

Sequence in context: A116245 A071308 A046188 this_sequence A017007 A023813 A068895

Adjacent sequences: A014384 A014385 A014386 this_sequence A014388 A014389 A014390

KEYWORD

nonn,hard

AUTHOR

njas

EXTENSIONS

More terms from Eric Rogoyski May 15 1997

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research