login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A006903 Number of triangle-free trivalent (or cubic) graphs with 2n labeled nodes.
(Formerly M4763)
1
0, 0, 0, 10, 3360, 1829520, 2010023400, 3622767548400, 9820308795897600, 38117776055769009600, 204209112522362230483200 (list; graph; refs; listen; history; internal format)
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 * A115481 A154238 A024139

Adjacent sequences:  A006900 A006901 A006902 * A006904 A006905 A006906

KEYWORD

nonn,nice

AUTHOR

Simon Plouffe, N. J. A. Sloane (njas(AT)research.att.com).

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

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

Last modified February 17 18:34 EST 2012. Contains 206074 sequences.