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 #52 Jan 10 2021 22:11:56
%S 0,0,0,1,2,15,121,2159,68715,3952378,389968005,65161587084
%N Number of simple unlabeled n-node graphs of edge-connectivity 3.
%H Travis Hoppe and Anna Petrone, <a href="https://github.com/thoppe/Encyclopedia-of-Finite-Graphs">Encyclopedia of Finite Graphs</a>
%H T. Hoppe and A. Petrone, <a href="http://arxiv.org/abs/1408.3644">Integer sequence discovery from small graphs</a>, arXiv preprint arXiv:1408.3644 [math.CO], 2014.
%H Jens M. Schmidt, <a href="https://www3.tuhh.de/e11/schmidt/CombinatorialData/GraphData.html">Combinatorial data</a>.
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/k-Edge-ConnectedGraph.html">k-Edge Connected Graph</a>.
%Y Column k=3 of A263296.
%Y Cf. other edge-connectivity unlabeled graph sequences A052446, A052447, A241703, A241704, A241705.
%Y Cf. A338511, A338583, A338593, A338594, A338604, A339072.
%K nonn,hard,more
%O 1,5
%A _Eric W. Weisstein_, May 08 2000
%E a(8), a(9), a(10) from the Encyclopedia of Finite Graphs by _Travis Hoppe_ and _Anna Petrone_, Apr 22 2014
%E a(11) by _Jens M. Schmidt_, Feb 18 2019
%E a(12) from _Jens M. Schmidt_'s web page, Jan 10 2021