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