A156805 Number of distinct interlace polynomials q of graphs of order n.

1, 2, 4, 8, 17, 41, 112, 369, 1555, 8625, 65323, 680275

Offset

1,2

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: A104879 A366220 A331686 * A200542 A272105 A367114

Adjacent sequences: A156802 A156803 A156804 * A156806 A156807 A156808

Keyword

hard,more,nonn

Author

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

Status

approved