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 A243271 #13 Feb 18 2025 15:35:08 %S A243271 1,0,1,2,2,4,2,5,4,6 %N A243271 Number of unlabeled simple graphs with n nodes that are Hamiltonian and distance-regular. %H A243271 Travis Hoppe and Anna Petrone, <a href="https://github.com/thoppe/Encyclopedia-of-Finite-Graphs">Encyclopedia of Finite Graphs</a>. %H A243271 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 A243271 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Distance-RegularGraph.html">Distance-Regular Graph</a>. %H A243271 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/HamiltonianGraph.html">Hamiltonian Graph</a>. %Y A243271 Cf. A003216 (Hamiltonian graphs), A241814 (distance-regular graphs). %K A243271 nonn,more %O A243271 1,4 %A A243271 _Travis Hoppe_ and _Anna Petrone_, Jun 02 2014