A006607 Number of labeled connected rooted trivalent graphs with 2n nodes.
0, 4, 120, 33600, 18446400, 18361728000, 30199104936000, 76326119565696000, 280889824362219072000, 1443428429045578335360000, 10016498030869925136622080000, 91330153089556497015273454080000
Offset: 1
Keywords
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