|
|
A236219
|
|
Number of simple Hamilton-laceable graphs on n nodes.
|
|
0
|
|
|
1, 1, 0, 1, 0, 2, 0, 12, 0, 226, 0
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,6
|
|
COMMENTS
|
a(1) = 1 follows from the convention that K_1 is traceable and bipartite.
Otherwise, a(2*n + 1) = 0.
|
|
LINKS
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|