|
Search: id:A123485
|
|
|
| A123485 |
|
Number of n-node labeled trivalent (or cubic) graphs with connectivity 2. |
|
+0
1
|
|
| 0, 0, 0, 2520, 1814400, 1888563600, 2979953776800, 6935468956416000, 23019567930463104000, 105689740661883810432000, 653795414851090462030080000, 5326203537908913517889391360000
(list; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
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: A109480 A066599 A107531 this_sequence A144971 A045942 A096026
Adjacent sequences: A123482 A123483 A123484 this_sequence A123486 A123487 A123488
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Nov 13 2006
|
|
|
Search completed in 0.002 seconds
|
