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 A122113 #10 Jan 17 2020 03:30:20 %S A122113 1,1,4,6,28,77,386,1787,10354,62040,404093,2725484,19078248 %N A122113 Number of pairwise non-isomorphic biconnected planar bipartite graphs on n vertices. %C A122113 Biconnected means "at least 2-connected". The corresponding sequence for 3-connected bipartite planar graph is A007028, where the term "polyhedral graph" is used as shorthand for "3-connected planar graph". %H A122113 F. Hüffner, <a href="https://github.com/falk-hueffner/tinygraph">tinygraph</a>, software for generating integer sequences based on graph properties, version 9766535. %e A122113 a(4) = 1 because the 4-cycle is the only planar and bipartite graph on 4 vertices that is at least 2-connected and a(5) = 1 because the complete bipartite graph K2,3 is the only such graph on 5 vertices. %Y A122113 Cf. A007028. %K A122113 nonn,more %O A122113 4,3 %A A122113 _Gordon F. Royle_, Oct 18 2006 %E A122113 a(15)-a(16) added using tinygraph by _Falk Hüffner_, May 09 2019