A014387 - OEIS

This site is supported by donations to The OEIS Foundation.

A014387

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

1, 1, 8, 725, 2806508 (list; graph; refs; listen; history; internal format)

	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 * A017007 A023813 A068895` `Adjacent sequences: A014384 A014385 A014386 * A014388 A014389 A014390`
	KEYWORD	`nonn,hard`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com).`
	EXTENSIONS	`More terms from Eric Rogoyski May 15 1997`

Content is available under The OEIS End-User License Agreement .

Last modified February 14 23:53 EST 2012. Contains 205689 sequences.