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 A243791 #15 Sep 14 2014 23:55:26 %S A243791 1,0,1,1,1,2,3,8,19,62 %N A243791 Number of simple connected graphs with n nodes that are Eulerian and have no subgraph isomorphic to the open-bowtie graph. %H A243791 Travis Hoppe and Anna Petrone, <a href="https://github.com/thoppe/Encyclopedia-of-Finite-Graphs">Encyclopedia of Finite Graphs</a> %H A243791 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 A243791 Cf. A242791 (open-bowtie free graphs), A003049 (Eulerian graphs). %K A243791 nonn,more %O A243791 1,6 %A A243791 _Travis Hoppe_ and _Anna Petrone_, Jun 16 2014