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 A243336 #8 Sep 14 2014 23:47:49 %S A243336 1,0,1,1,3,6,22,93,656,7484 %N A243336 Number of simple connected graphs with n nodes that are Eulerian and K_4 free. %C A243336 K_4 is the complete graph on four vertices. %H A243336 Travis Hoppe and Anna Petrone, <a href="https://github.com/thoppe/Encyclopedia-of-Finite-Graphs">Encyclopedia of Finite Graphs</a> %H A243336 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 A243336 Cf. A003049 (Eulerian graphs), A079574 (K_4 free graphs). %K A243336 nonn,more %O A243336 1,5 %A A243336 _Travis Hoppe_ and _Anna Petrone_, Jun 03 2014