login
Number of (undirected) Hamiltonian paths in the n-Andrásfai graph.
0

%I #10 Feb 09 2024 07:55:14

%S 1,5,72,3047,265034,42442251,11193312580,4549752670983,

%T 2695786727116054,2234966723808142779

%N Number of (undirected) Hamiltonian paths in the n-Andrásfai graph.

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/AndrasfaiGraph.html">Andrásfai Graph</a>

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/HamiltonianPath.html">Hamiltonian Path</a>

%F a(n) = A137884(n)/2.

%Y Cf. A137884.

%K nonn,hard,more

%O 1,2

%A _Eric W. Weisstein_, May 06 2019