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 A241707 #21 Jun 02 2025 10:11:15 %S A241707 0,0,0,1,5,43,387,5797,148229,6959721 %N A241707 Number of simple connected graphs on n nodes with diameter 3. %H A241707 Travis Hoppe and Anna Petrone, <a href="https://github.com/thoppe/Encyclopedia-of-Finite-Graphs">Encyclopedia of Finite Graphs</a> %H A241707 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 A241707 Peter Steinbach, <a href="/A000088/a000088_17.pdf">Field Guide to Simple Graphs, Volume 1</a>, Part 17 [But beware errors] (For Volumes 1, 2, 3, 4 of this book see A000088, A008406, A000055, A000664, respectively.) %H A241707 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/GraphDiameter.html">Graph Diameter</a> %Y A241707 Column k=3 of A294522. %Y A241707 Simple connected graphs of diameter k: A241706, A241707, A241708, A241709, A241710. %K A241707 nonn,hard,more %O A241707 1,5 %A A241707 _Travis Hoppe_ and _Anna Petrone_, Apr 27 2014