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!)
A006607 Number of labeled connected rooted trivalent graphs with 2n nodes.
(Formerly M3711)
2
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
CROSSREFS
Cf. A002829, A286757 (corrected version?)
Sequence in context: A001332 A071304 A213957 * A286757 A239187 A062081
KEYWORD
nonn
AUTHOR
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 07:46 EDT 2024. Contains 371235 sequences. (Running on oeis4.)