A156804 Number of distinct interlace polynomials q of connected graphs of order n.

1, 1, 2, 4, 9, 24, 71, 257, 1186, 7070, 56698, 614952

Offset

1,3

Links

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

M. Aigner and H. van der Holst, Interlace polynomials, Linear Algebra Appl., 377 (2004), 11-30.

R. Arratia, B. Bollobas, and G. B. Sorkin, The Interlace Polynomial of a Graph, J. Combin. Theory Ser. B, 92 (2004), 199-233.

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

Crossrefs

Sequence in context: A148083 A200966 A148084 * A081913 A092236 A367112

Adjacent sequences: A156801 A156802 A156803 * A156805 A156806 A156807

Keyword

hard,more,nonn

Author

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

Status

approved