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 A243335 #14 Jan 15 2016 11:30:23 %S A243335 1,0,0,1,1,2,3,8,19,62,229,1192,8147,80182,1106086 %N A243335 Number of simple connected graphs with n nodes that are Eulerian and triangle-free. %H A243335 Travis Hoppe and Anna Petrone, <a href="https://github.com/thoppe/Encyclopedia-of-Finite-Graphs">Encyclopedia of Finite Graphs</a> %H A243335 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, 2014 %H A243335 F. Hüffner, <a href="https://github.com/falk-hueffner/tinygraph">tinygraph</a>, software for generating integer sequences based on graph properties, version 69d4186. %Y A243335 Cf. A003049 (Eulerian graphs), A024607 (triangle-free graphs). %K A243335 nonn,more %O A243335 1,6 %A A243335 _Travis Hoppe_ and _Anna Petrone_, Jun 03 2014 %E A243335 a(11)-a(15) added using tinygraph by _Falk Hüffner_, Jan 15 2016