A006903 - OEIS

This site is supported by donations to The OEIS Foundation.

A006903

Number of triangle-free trivalent (or cubic) graphs with 2n labeled nodes.
(Formerly M4763)

0, 0, 0, 10, 3360, 1829520, 2010023400, 3622767548400, 9820308795897600, 38117776055769009600, 204209112522362230483200 (list; graph; refs; listen; history; text; internal format)

	OFFSET	`0,4`
	REFERENCES	`R. W. Robinson, Numerical implementation of graph counting algorithms, AGRC Grant, Math. Dept., Univ. Newcastle, Australia, 1977.` `N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).` `N. C. Wormald, The number of labeled cubic graphs with no triangles, Congress. Numerantium, 33 (1981), 359-378.`
	LINKS	`Table of n, a(n) for n=0..10.`
	CROSSREFS	`Sequence in context: A001329 A007101 A007103 * A115481 A154238 A024139` `Adjacent sequences: A006900 A006901 A006902 * A006904 A006905 A006906`
	KEYWORD	`nonn,nice`
	AUTHOR	`Simon Plouffe and N. J. A. Sloane.`
	EXTENSIONS	`Confirmed by Gordon F. Royle, May 31, 2000.`
	STATUS	`approved`

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

Last modified June 20 05:50 EDT 2013. Contains 226419 sequences.