|
|
A156806
|
|
Number of distinct interlace polynomials Q of connected graphs of order n.
|
|
0
|
|
|
1, 1, 1, 2, 4, 10, 23, 84, 337, 2154, 22956, 486488
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,4
|
|
LINKS
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
hard,more,nonn
|
|
AUTHOR
|
Lars Eirik Danielsen (larsed(AT)ii.uib.no), Feb 16 2009
|
|
STATUS
|
approved
|
|
|
|