login
The OEIS is supported by the many generous donors 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
1, 0, 0, 10, 3360, 1829520, 2010023400, 3622767548400, 9820308795897600, 38117776055769009600, 204209112522362230483200, 1465227517158776390187168000, 13730711637579303579659695248000 (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
CROSSREFS
Cf. A014371.
Sequence in context: A001329 A007101 A007103 * A115481 A154238 A234144
KEYWORD
nonn,nice
AUTHOR
EXTENSIONS
Confirmed by Gordon F. Royle, May 31 2000
a(0) changed to 1 and a(11)-a(12) added by Sean A. Irvine, Aug 29 2017
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 20:05 EDT 2024. Contains 371254 sequences. (Running on oeis4.)