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 A243796 #28 Dec 28 2017 01:31:25 %S A243796 1,0,1,2,4,15,58,360,2793,28761,369545,5914974,116089531,2816695796 %N A243796 Number of graphs with n nodes that are chordal and Hamiltonian. %C A243796 We generated all biconnected chordal graphs up to 14 vertices using Brendan McKay's Nauty Software and Algorithms, then used a program we wrote to identify Hamiltonian graphs. - _Philip Nelson_, _Ammon Hepworth_, _Raul A. Ramirez_, Dec 16 2017 %H A243796 Ammon Hepworth, Philip Nelson, and Raul Ramirez, <a href="https://github.com/Sailanarmo/HamiltonianCycles">Hamiltonian Cycles</a> %H A243796 Travis Hoppe and Anna Petrone, <a href="https://github.com/thoppe/Encyclopedia-of-Finite-Graphs">Encyclopedia of Finite Graphs</a> %H A243796 T. Hoppe and A. 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 A243796 F. Hüffner, <a href="https://github.com/falk-hueffner/tinygraph">tinygraph</a>, software for generating integer sequences based on graph properties, version a1db88e %H A243796 Brendan McKay's Nauty Software and Algorithms, <a href="http://pallini.di.uniroma1.it">nauty and Traces</a> %Y A243796 Cf. A048192 (chordal graphs), A003216 (Hamiltonian graphs). %K A243796 nonn,more %O A243796 1,4 %A A243796 _Travis Hoppe_ and _Anna Petrone_, Jun 27 2014 %E A243796 a(11) added using tinygraph by _Falk Hüffner_, Aug 15 2017 %E A243796 a(12)-a(14) from _Philip Nelson_, Dec 16 2017