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 A243320 #17 Apr 06 2017 02:35:09 %S A243320 1,0,0,1,0,2,1,6,7,29,64,287,1148,7267,55997,620561 %N A243320 Number of simple connected graphs with n nodes that are bipartite and Eulerian. %H A243320 Travis Hoppe and Anna Petrone, <a href="https://github.com/thoppe/Encyclopedia-of-Finite-Graphs">Encyclopedia of Finite Graphs</a> %H A243320 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 A243320 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 A243320 Cf. A005142 (bipartite graphs), A003049 (Eulerian graphs). %K A243320 nonn,more %O A243320 1,6 %A A243320 _Travis Hoppe_ and _Anna Petrone_, Jun 03 2014 %E A243320 a(11)-a(16) added using tinygraph by _Falk Hüffner_, Jan 15 2016