login
A301559
Number of (undirected) Hamiltonian paths in the n-odd graph.
0
0, 3, 120, 328345920
OFFSET
1,2
LINKS
Eric Weisstein's World of Mathematics, Hamiltonian Path
Eric Weisstein's World of Mathematics, Odd Graph
FORMULA
a(n) = A233826(n)/2.
CROSSREFS
Cf. A233826 (directed Hamiltonian paths).
Sequence in context: A246292 A202768 A289986 * A141440 A156001 A229633
KEYWORD
nonn,more,hard
AUTHOR
Eric W. Weisstein, Mar 23 2018
STATUS
approved