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 A243324 #10 Nov 26 2015 14:31:11 %S A243324 0,0,0,0,2,6,33,180,1773,31006 %N A243324 Number of simple connected graphs with n nodes that are Eulerian and not integral. %H A243324 Travis Hoppe and Anna Petrone, <a href="https://github.com/thoppe/Encyclopedia-of-Finite-Graphs">Encyclopedia of Finite Graphs</a> %H A243324 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 %Y A243324 Cf. A003049 (Eulerian graphs), A241842 (non-integral graphs). %K A243324 nonn,more %O A243324 1,5 %A A243324 _Travis Hoppe_ and _Anna Petrone_, Jun 03 2014