|
%I M4761 #11 Mar 30 2012 16:45:07
%S 1,10,3360,1753920,1812888000,3158396841600,8496995611104000,
%T 33199738565849856000,180116271096528678912000,
%U 1310903590075375049994240000,12454930569778045924343408640000
%N Number of labeled trivalent (or cubic) cyclically 4-connected graphs with 2n nodes.
%D R. W. Robinson, personal communication.
%D R. W. Robinson, Numerical implementation of graph counting algorithms, AGRC Grant, Math. Dept., Univ. Newcastle, Australia, 1976.
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H R. W. Robinson, <a href="/A007101/b007101.txt">Table of n, a(n) for n = 2..30</a>
%H N. C. Wormald, <a href="http://dx.doi.org/10.1002/jgt.3190090418">Enumeration of cyclically 4-connected cubic graphs</a>, J. Number Theory 9 (4) (1985) 563, Theorem 4.1.
%K nonn
%O 2,2
%A _N. J. A. Sloane_.
|
