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 A241705 #27 Feb 16 2025 08:33:22 %S A241705 0,0,0,0,0,0,1,4,65,3441,857365,487560158,466534106494 %N A241705 Number of simple unlabeled n-node graphs of edge-connectivity 6. %H A241705 Travis Hoppe and Anna Petrone, <a href="https://github.com/thoppe/Encyclopedia-of-Finite-Graphs">Encyclopedia of Finite Graphs</a> %H A241705 Jens M. Schmidt, <a href="/A324088/a324088.html">Data files in graph6 format</a> %H A241705 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 A241705 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/k-Edge-ConnectedGraph.html">k-Edge Connected Graph.</a> %Y A241705 Column k=6 of A263296. %Y A241705 Cf. other edge-connectivity unlabeled graph sequences A052446, A052447, A052448, A241703, A241704. %K A241705 nonn,hard,more %O A241705 1,8 %A A241705 _Travis Hoppe_ and _Anna Petrone_, Apr 27 2014 %E A241705 a(11)-a(13) by _Jens M. Schmidt_, Feb 20 2019