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 A243322 #8 Sep 14 2014 23:39:53 %S A243322 1,0,1,1,2,2,2,3,4,4 %N A243322 Number of simple connected graphs with n nodes that are distance regular and Eulerian. %H A243322 Travis Hoppe and Anna Petrone, <a href="https://github.com/thoppe/Encyclopedia-of-Finite-Graphs">Encyclopedia of Finite Graphs</a> %H A243322 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 A243322 Cf. A241814 (distance regular graphs), A003049 (Eulerian graphs). %K A243322 nonn,more %O A243322 1,5 %A A243322 _Travis Hoppe_ and _Anna Petrone_, Jun 03 2014