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

1, 5, 72, 3047, 265034, 42442251, 11193312580, 4549752670983, 2695786727116054, 2234966723808142779

Offset

1,2

Links

Table of n, a(n) for n=1..10.

Eric Weisstein's World of Mathematics, Andrásfai Graph

Eric Weisstein's World of Mathematics, Hamiltonian Path

Formula

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

Crossrefs

Cf. A137884.

Sequence in context: A197324 A197977 A362679 * A136637 A319767 A341670

Adjacent sequences: A307929 A307930 A307931 * A307933 A307934 A307935

Keyword

nonn,hard,more

Author

Eric W. Weisstein, May 06 2019

Status

approved