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

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A006607 Number of labeled connected rooted trivalent graphs with 2n nodes.
(Formerly M3711)
1
0, 4, 120, 33600, 18446400, 18361728000, 30199104936000, 76326119565696000, 280889824362219072000, 1443428429045578335360000, 10016498030869925136622080000, 91330153089556497015273454080000 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

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, Triangles in labeled cubic graphs, pp. 337-345 of Combinatorial Mathematics (Canberra, 1977), Lect. Notes Math. 686, 1978.

LINKS

R. W. Robinson, Table of n, a(n) for n = 1..29

CROSSREFS

Sequence in context: A001332 A071304 A213957 * A239187 A062081 A053881

Adjacent sequences:  A006604 A006605 A006606 * A006608 A006609 A006610

KEYWORD

nonn

AUTHOR

N. J. A. Sloane.

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified December 2 19:13 EST 2016. Contains 278683 sequences.