|
%I #9 May 14 2019 10:50:05
%S 0,3,120,328345920
%N Number of (undirected) Hamiltonian paths in the n-odd graph.
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/HamiltonianPath.html">Hamiltonian Path</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/OddGraph.html">Odd Graph</a>
%F a(n) = A233826(n)/2.
%Y Cf. A233826 (directed Hamiltonian paths).
%K nonn,more,hard
%O 1,2
%A _Eric W. Weisstein_, Mar 23 2018
|
