|
Search: id:A007099
|
|
|
| A007099 |
|
Number of labeled trivalent (or cubic) 2-connected graphs with 2n nodes.
(Formerly M5344)
|
|
+0
1
|
|
| 1, 70, 19320, 11052720, 11408720400, 19285018552800, 49792044478176000, 186348919238786304000, 970566620767088881536000, 6808941648018137282054400000, 62642603299257346706851910400000
(list; graph; listen)
|
|
|
OFFSET
|
2,2
|
|
|
REFERENCES
|
R. W. Robinson, personal communication.
R. W. Robinson, Numerical implementation of graph counting algorithms, AGRC Grant, Math. Dept., Univ. Newcastle, Australia, 1976.
|
|
LINKS
|
R. W. Robinson, Table of n, a(n) for n = 2..29
|
|
CROSSREFS
|
Sequence in context: A049216 A007100 A103157 this_sequence A004109 A002829 A005983
Adjacent sequences: A007096 A007097 A007098 this_sequence A007100 A007101 A007102
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas
|
|
|
Search completed in 0.002 seconds
|
