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 #24 Jan 19 2021 20:17:56
%S 0,0,0,0,0,1,3,41,1095,104829,21981199,8077770931
%N Number of simple unlabeled n-node graphs of edge-connectivity 5.
%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="/A324088/a324088.html">Data files in graph6 format</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=5 of A263296.
%Y Cf. other edge-connectivity unlabeled graph sequences A052446, A052447, A052448, A241703, A241705.
%K nonn,hard,more
%O 1,7
%A _Travis Hoppe_ and _Anna Petrone_, Apr 27 2014
%E a(11)-a(12) by _Jens M. Schmidt_, Feb 18 2019