%I #42 Mar 07 2022 07:56:07
%S 1,4,39,1051,102630,22331311
%N Number of 5-connected graphs on n nodes.
%H Travis Hoppe and Anna 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 Travis Hoppe and Anna Petrone, <a href="https://github.com/thoppe/Encyclopedia-of-Finite-Graphs">Encyclopedia of Finite Graphs</a>
%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-ConnectedGraph.html">k-Connected Graph</a>
%F a(n) = A324240(n) + A324234(n). - _Andrew Howroyd_, Sep 04 2019
%F a(n) = A086216(n) - A052445(n). - _Jean-François Alcover_, Sep 13 2019, after _Andrew Howroyd_ in A086216
%Y Cf. A002218, A052443, A052445, A086216, A259862, A324234, A324240.
%K nonn,hard,more
%O 6,2
%A _Eric W. Weisstein_, Jul 12 2003
%E Offset corrected by _Travis Hoppe_, Apr 11 2014
%E a(10) from the Encyclopedia of Finite Graphs (_Travis Hoppe_ and _Anna Petrone_), Apr 11 2014
%E a(11) by _Jens M. Schmidt_, Feb 20 2019