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 A126201 #9 Dec 17 2016 10:27:33 %S A126201 1,1,3,11,57,375,3398,40043,585440,9895493 %N A126201 Number of rooted connected unlabeled planar graphs on n nodes. %C A126201 Number of "pointed" connected planar graphs on n nodes: number of pairs (G,P) where G is a connected unlabeled planar graph with n nodes and P runs through the orbit representatives of nodes in G under the action of Aut(G). %C A126201 For n <= 4 this agrees with A126100; a(5) = A126100(5) - 1 = 57, since K_5 is the only excluded graph on 5 nodes. %Y A126201 Cf. A005470, A039735, A126100. %K A126201 nonn,more %O A126201 1,3 %A A126201 _David Applegate_ and _N. J. A. Sloane_, Mar 09 2007 %E A126201 a(6)-a(10) from _Brendan McKay_, Mar 10 2007