A308131 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A308131

Number of (undirected) Hamiltonian paths in the n X n knight graph.

2

0, 0, 0, 0, 864, 3318960, 82787609160, 9795914085489952

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,5

LINKS

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

Eric Weisstein's World of Mathematics, Hamiltonian Path

Eric Weisstein's World of Mathematics, Knight Graph

FORMULA

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

CROSSREFS

Cf. A165134, A169696 (3 X n), A079137 (4 X n), A083386 (5 X n), A306281 (6 X n), A306283 (7 X n).

Sequence in context: A299413 A300055 A082243 * A114497 A129035 A129034

Adjacent sequences: A308128 A308129 A308130 * A308132 A308133 A308134

KEYWORD

nonn,more,hard

AUTHOR

Eric W. Weisstein, May 14 2019

STATUS

approved