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 A241768 #20 Feb 16 2025 08:33:22 %S A241768 0,0,0,1,3,17,101,890,11468,239728 %N A241768 Number of simple connected graphs with n nodes and exactly 2 articulation points (cutpoints). %H A241768 Travis Hoppe and Anna Petrone, <a href="https://github.com/thoppe/Encyclopedia-of-Finite-Graphs">Encyclopedia of Finite Graphs</a> %H A241768 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 A241768 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/ArticulationVertex.html">Articulation Vertex</a> %Y A241768 Column k=2 of A325111. %Y A241768 Cf. other simple connected graph sequences with k articulation points A002218, A241767, A241768, A241769, A241770, A241771. %K A241768 nonn,hard,more %O A241768 1,5 %A A241768 _Travis Hoppe_ and _Anna Petrone_, Apr 28 2014