%I #9 Nov 25 2020 09:12:15

%S 1,3,19,149,2578,84127,5201474,577043450,113371887160,39618007594177,

%T 24916462201698733,28563626901315427552,60366734333061918085970,

%U 237406975833857522512566844,1750330441805919888169149998870

%N Number of unlabeled 2-connected 3-edge-connected graphs with n nodes.

%H S. K. Pootheri, <a href="https://athenaeum.libs.uga.edu/handle/10724/20082">Counting classes of labeled 2-connected graphs</a>, M.S. Dissertation, University of Georgia, 2000.

%H S. K. Pootheri, <a href="/A054595/a054595.pdf">Counting classes of labeled 2-connected graphs</a>, M.S. Thesis, University of Georgia, 2000. [Local copy]

%H S. K. Pootheri, <a href="https://athenaeum.libs.uga.edu/handle/10724/20083">Characterizing and counting classes of unlabeled 2-connected graphs</a>, Ph. D. Dissertation, University of Georgia, 2000.

%H S. K. Pootheri, <a href="/A003317/a003317_1.pdf">Characterizing and counting classes of unlabeled 2-connected graphs</a>, Ph. D. Dissertation, University of Georgia, 2000. [Local copy]

%Y Cf. A054317, A003317.

%K hard,nice,nonn

%O 4,2

%A Sridar K. Pootheri (sridar(AT)math.uga.edu), Feb 25 2000