id:A006903 - OEIS Search Results

Search: id:A006903

Displaying 1-1 of 1 results found.

page 1

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

+0
2

0, 0, 0, 10, 3360, 1829520, 2010023400, 3622767548400, 9820308795897600, 38117776055769009600, 204209112522362230483200 (list; graph; listen)

	OFFSET	`0,4`
	REFERENCES	`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.` `Confirmed by Gordon Royle (gordon(AT)maths.uwa.edu.au), May 31, 2000.`
	CROSSREFS	`Sequence in context: A001329 A007101 A007103 this_sequence A115481 A154238 A024139` `Adjacent sequences: A006900 A006901 A006902 this_sequence A006904 A006905 A006906`
	KEYWORD	`nonn,nice`
	AUTHOR	`Simon Plouffe, N. J. A. Sloane (njas(AT)research.att.com).`

page 1

Search completed in 0.002 seconds

Last modified December 4 15:11 EST 2009. Contains 170347 sequences.