cp's OEIS Frontend

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.

A156808 Number of nonisomorphic connected circle graphs of order n.

This page as a plain text file.
%I A156808 #7 Jul 22 2025 06:21:23
%S A156808 1,1,2,6,21,110,789,8336,117283,2026331,40302425,892278076
%N A156808 Number of nonisomorphic connected circle graphs of order n.
%H A156808 R. Arratia, B. Bollobas, D. Coppersmith, and G. B. Sorkin, <a href="https://doi.org/10.1016/S0166-218X(00)00190-6">Euler circuits and DNA sequencing by hybridization</a>, Discrete Appl. Math., 104 (2000), 63-96.
%H A156808 L. E. Danielsen and M. G. Parker, <a href="http://arxiv.org/abs/0804.2576">Interlace polynomials: Enumeration, unimodality, and connections to codes</a>, arXiv:0804.2576 [math.CO], 2008-2009.
%H A156808 L. E. Danielsen, <a href="http://www.ii.uib.no/~larsed/circle/">Database of Circle Graphs</a>.
%Y A156808 Cf. A156809.
%K A156808 hard,nonn
%O A156808 1,3
%A A156808 Lars Eirik Danielsen (larsed(AT)ii.uib.no), Feb 16 2009