login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A122511
Number of n-node labeled trivalent (or cubic) graphs with connectivity 1.
1
0, 0, 0, 0, 113400, 134719200, 206367361200, 441231126336000, 1314804135572928000, 5371366122198236160000, 29519910833205467394720000, 214250468144929272764547840000
OFFSET
1,5
REFERENCES
R. W. Robinson, Numerical implementation of graph counting algorithms, AGRC Grant, Math. Dept., Univ. Newcastle, Australia, 1977.
LINKS
CROSSREFS
Sequence in context: A252036 A103113 A179922 * A172549 A172589 A172692
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Nov 13 2006
STATUS
approved