%I M5190 #16 Dec 25 2018 22:35:58
%S 1,26,1768,225096,51725352,21132802544,15463799747936,
%T 20604021770403328,50928019401158515328,237644423948928994197504,
%U 2125373296900166452199861760,36884133903194627014531723872256
%N Number of labeled 3-connected graphs with n nodes.
%D Miklos Bona, editor, Handbook of Enumerative Combinatorics, CRC Press, 2015, p. 403.
%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="/A005644/b005644.txt">Table of n, a(n) for n = 4..25</a>
%H T. R. S. Walsh, <a href="https://doi.org/10.1016/0095-8956(82)90072-7">Counting labeled three-connected and homeomorphically irreducible two-connected graphs</a>, J. Combin. Theory Ser. B 32 (1982), no. 1, 1-11.
%Y Row sums of A123542.
%K nonn
%O 4,2
%A _N. J. A. Sloane_.
%E Corrected and extended by _N. J. A. Sloane_, Nov 13 2006