login
A236219
Number of simple Hamilton-laceable graphs on n nodes.
0
1, 1, 0, 1, 0, 2, 0, 12, 0, 226, 0
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
Eric Weisstein's World of Mathematics, Hamilton-Laceable Graph
CROSSREFS
Sequence in context: A285480 A156431 A067994 * A143246 A286198 A287079
KEYWORD
nonn,more
AUTHOR
Eric W. Weisstein, Jan 20 2014
STATUS
approved