This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A086216 #60 Feb 16 2025 08:32:50 %S A086216 0,0,0,0,1,4,25,384,14480,1211735,184649399,47952362294 %N A086216 Number of 4-connected unlabeled n-node graphs. %C A086216 The definition means that the connectivity is 4 or more. %H A086216 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 A086216 Travis Hoppe and Anna Petrone, <a href="http://doi.org/10.1016/j.dam.2015.07.017">Integer sequence discovery from small graphs</a>, Discr. Appl. Math. 201 (2016) 172-181. %H A086216 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/k-ConnectedGraph.html">k-Connected Graph</a> %F A086216 a(n) = A086217(n) + A052445(n). - _Andrew Howroyd_, Sep 04 2019 %e A086216 There are 4 different 4-connected graphs on 6 vertices. - _Dylan Thurston_, Jun 18 2009 %Y A086216 See A052445 for exactly-4-connected graphs. %Y A086216 See A086217 for 5-connected graphs. %Y A086216 See A259862 for further information. %K A086216 nonn,hard,more %O A086216 1,6 %A A086216 _Eric W. Weisstein_, Jul 12 2003 %E A086216 Offset corrected by _Dylan Thurston_, Jun 18 2009 %E A086216 a(10) from the Encyclopedia of Finite Graphs (_Travis Hoppe_ and _Anna Petrone_), Apr 11 2014 %E A086216 Minor edits by _N. J. A. Sloane_, Jul 08 2015 at the suggestion of _Brendan McKay_. %E A086216 a(12) added by _Georg Grasegger_, Jan 07 2025