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 A243560 #20 Aug 15 2017 13:55:09 %S A243560 1,0,1,1,2,9,27,190,1750,25658,531204 %N A243560 Number of simple connected graphs with n nodes that are Hamiltonian and have no subgraph isomorphic to diamond graph. %H A243560 Travis Hoppe and Anna Petrone, <a href="https://github.com/thoppe/Encyclopedia-of-Finite-Graphs">Encyclopedia of Finite Graphs</a> %H A243560 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 A243560 F. Hüffner, <a href="https://github.com/falk-hueffner/tinygraph">tinygraph</a>, software for generating integer sequences based on graph properties, version a1db88e %Y A243560 Cf. A242790 (diamond free graphs), A003216 (Hamiltonian graphs). %K A243560 nonn,more %O A243560 1,5 %A A243560 _Travis Hoppe_ and _Anna Petrone_, Jun 06 2014 %E A243560 a(11) added using tinygraph by _Falk Hüffner_, Aug 15 2017