|
Search: id:A122511
|
|
|
| A122511 |
|
Number of n-node labeled trivalent (or cubic) graphs with connectivity 1. |
|
+0
1
|
|
| 0, 0, 0, 0, 113400, 134719200, 206367361200, 441231126336000, 1314804135572928000, 5371366122198236160000, 29519910833205467394720000, 214250468144929272764547840000
(list; graph; listen)
|
|
|
OFFSET
|
1,5
|
|
|
REFERENCES
|
R. W. Robinson, Numerical implementation of graph counting algorithms, AGRC Grant, Math. Dept., Univ. Newcastle, Australia, 1977.
|
|
LINKS
|
R. W. Robinson, Table of n, a(n) for n = 1..30
|
|
CROSSREFS
|
Sequence in context: A033447 A102497 A103113 this_sequence A066790 A135411 A108387
Adjacent sequences: A122508 A122509 A122510 this_sequence A122512 A122513 A122514
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas, Nov 13 2006
|
|
|
Search completed in 0.002 seconds
|
