|
%I #4 Mar 30 2012 16:50:35
%S 0,0,0,2520,1814400,1888563600,2979953776800,6935468956416000,
%T 23019567930463104000,105689740661883810432000,
%U 653795414851090462030080000,5326203537908913517889391360000
%N Number of n-node labeled trivalent (or cubic) graphs with connectivity 2.
%D R. W. Robinson, Numerical implementation of graph counting algorithms, AGRC Grant, Math. Dept., Univ. Newcastle, Australia, 1977.
%H R. W. Robinson, <a href="/A123485/b123485.txt">Table of n, a(n) for n = 1..30</a>
%K nonn
%O 1,4
%A _N. J. A. Sloane_, Nov 13 2006
|
