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 A243337 #13 May 10 2019 15:11:06 %S A243337 1,1,2,5,17,79,478,4123,46666,648758,10275896,177007433 %N A243337 Number of simple connected graphs with n nodes that are planar and K_4 free. %C A243337 K_4 is the complete graph on four vertices. %H A243337 Travis Hoppe and Anna Petrone, <a href="https://github.com/thoppe/Encyclopedia-of-Finite-Graphs">Encyclopedia of Finite Graphs</a> %H A243337 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 [math.CO], 2014. %H A243337 F. Hüffner, <a href="https://github.com/falk-hueffner/tinygraph">tinygraph</a>, software for generating integer sequences based on graph properties, version 9766535. %Y A243337 Cf. A003094 (planar graphs), A079574 (K_4 free graphs). %K A243337 nonn,more %O A243337 1,3 %A A243337 _Travis Hoppe_ and _Anna Petrone_, Jun 03 2014 %E A243337 a(11)-a(12) added using tinygraph by _Falk Hüffner_, May 10 2019