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 A243270 #18 Feb 18 2025 15:35:12 %S A243270 1,0,0,1,0,4,0,24,0,473,0,30512,0,6374556 %N A243270 Number of unlabeled simple graphs with n nodes that are Hamiltonian and bipartite. %H A243270 Travis Hoppe and Anna Petrone, <a href="https://github.com/thoppe/Encyclopedia-of-Finite-Graphs">Encyclopedia of Finite Graphs</a>. %H A243270 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 A243270 Falk Hüffner, <a href="https://github.com/falk-hueffner/tinygraph">tinygraph</a>, software for generating integer sequences based on graph properties, version 4361e42 %H A243270 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/BipartiteGraph.html">Bipartite Graph</a>. %H A243270 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/HamiltonianGraph.html">Hamiltonian Graph</a>. %Y A243270 Cf. A003216 (Hamiltonian graphs), A005142 (bipartite graphs). %K A243270 nonn,more %O A243270 1,6 %A A243270 _Travis Hoppe_ and _Anna Petrone_, Jun 02 2014 %E A243270 a(11)-a(14) added using tinygraph by _Falk Hüffner_, Aug 13 2017