A156809 Number of nonisomorphic circle graphs of order n

1, 2, 4, 11, 34, 154, 978, 9497, 127954, 2165291, 42609994, 937233306, 22576188846

Offset

1,2

Links

Table of n, a(n) for n=1..13.

R. Arratia, B. Bollobas, D. Coppersmith, and G. B. Sorkin, Euler circuits and DNA sequencing by hybridization, Discrete Appl. Math., 104 (2000), 63-96.

Gi-Sang Cheon, Jinha Kim, Minki Kim, Sergey Kitaev, On k-11-representable graphs, arXiv:1803.01055 [math.CO], 2018.

L. E. Danielsen and M. G. Parker, Interlace polynomials: Enumeration, unimodality, and connections to codes, arXiv:0804.2576 [math.CO], 2008-2009.

L. E. Danielsen, Database of Circle Graphs.

Crossrefs

Cf. A156808.

Sequence in context: A357891 A217043 A249696 * A215620 A076317 A076318

Adjacent sequences: A156806 A156807 A156808 * A156810 A156811 A156812

Keyword

hard,nonn

Author

Lars Eirik Danielsen (larsed(AT)ii.uib.no), Feb 16 2009

Extensions

a(13) from Tom Johnston, Oct 17 2020

Status

approved