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 A241703 #30 Feb 16 2025 08:33:22 %S A241703 0,0,0,0,1,3,25,378,14306,1141575,164245876,39637942895 %N A241703 Number of simple unlabeled n-node graphs of edge-connectivity 4. %H A241703 Travis Hoppe and Anna Petrone, <a href="https://github.com/thoppe/Encyclopedia-of-Finite-Graphs">Encyclopedia of Finite Graphs</a> %H A241703 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 A241703 Jens M. Schmidt, <a href="https://www3.tuhh.de/e11/schmidt/CombinatorialData/GraphData.html">Combinatorial data</a>. %H A241703 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/k-Edge-ConnectedGraph.html">k-Edge Connected Graph.</a> %Y A241703 Column k=4 of A263296. %Y A241703 Cf. other edge-connectivity unlabeled graph sequences A052446, A052447, A052448, A241704, A241705. %K A241703 nonn,hard,more %O A241703 1,6 %A A241703 _Travis Hoppe_ and _Anna Petrone_, Apr 27 2014 %E A241703 a(11) by _Jens M. Schmidt_, Feb 18 2019 %E A241703 a(12) from _Jens M. Schmidt_'s web page, Jan 10 2021