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 A241814 #10 Feb 16 2025 08:33:22 %S A241814 1,1,1,2,2,4,2,5,4,7 %N A241814 Number of distance-regular simple connected graphs on n nodes. %C A241814 Since the smallest distance-regular graph that is not distance-transitive is the Shrikhande graph with 16 vertices (Brouwer et al. 1989, p. 136), this counts distance transitive graphs up to and including a(15). %H A241814 Travis Hoppe and Anna Petrone, <a href="https://github.com/thoppe/Encyclopedia-of-Finite-Graphs">Encyclopedia of Finite Graphs</a> %H A241814 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 A241814 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Distance-RegularGraph.html">Distance-Regular Graph</a> %K A241814 nonn,hard,more %O A241814 1,4 %A A241814 _Travis Hoppe_ and _Anna Petrone_, Apr 29 2014