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”).
%I #5 Mar 30 2012 16:50:31
%S 0,0,0,0,113400,134719200,206367361200,441231126336000,
%T 1314804135572928000,5371366122198236160000,
%U 29519910833205467394720000,214250468144929272764547840000
%N Number of n-node labeled trivalent (or cubic) graphs with connectivity 1.
%D R. W. Robinson, Numerical implementation of graph counting algorithms, AGRC Grant, Math. Dept., Univ. Newcastle, Australia, 1977.
%H R. W. Robinson, <a href="/A122511/b122511.txt">Table of n, a(n) for n = 1..30</a>
%K nonn
%O 1,5
%A _N. J. A. Sloane_, Nov 13 2006