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 A318188 #25 Sep 07 2018 03:55:24 %S A318188 0,1,1,3,10,54,407,4630,68425,1211637 %N A318188 Number of nonisomorphic 2-connected circle graphs of order n. %H A318188 L. E. Danielsen, <a href="http://www.ii.uib.no/~larsed/circle/">Database of Circle Graphs</a> %H A318188 L. E. Danielsen and M. G. Parker, <a href="https://arxiv.org/abs/0804.2576">Interlace polynomials: Enumeration, unimodality, and connections to codes</a>, arXiv:0804.2576 [math.CO], 2008-2009. %H A318188 L. E. Danielsen and M. G. Parker, <a href="https://doi.org/10.1016/j.dam.2009.11.011">Interlace polynomials: Enumeration, unimodality, and connections to codes</a>, Discrete Appl. Math. 158(6), pp. 636-648, 2010. %e A318188 The 3 circle graphs with n = 4 vertices which are 2-connected are K_4, the square and the square with one diagonal. %Y A318188 Cf. A156809, A156808, A002218. %K A318188 nonn,hard,more %O A318188 1,4 %A A318188 _Fidel I. Schaposnik_, Sep 01 2018