|
Search: id:A006903
|
|
|
| A006903 |
|
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. C. Wormald, The number of labeled cubic graphs with no triangles, Congress. Numerantium, 33 (1981), 359-378.
Confirmed by Gordon Royle (gordon(AT)cs.uwa.edu.au), May 31, 2000.
|
|
CROSSREFS
|
Adjacent sequences: A006900 A006901 A006902 this_sequence A006904 A006905 A006906
Sequence in context: A001329 A007101 A007103 this_sequence A115481 A024139 A061888
|
|
KEYWORD
|
nonn,nice
|
|
AUTHOR
|
Simon Plouffe, njas
|
|
|
Search completed in 0.002 seconds
|
