cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

Original entry on oeis.org

0, 0, 0, 0, 864, 3318960, 82787609160, 9795914085489952
Offset: 1

Views

Author

Eric W. Weisstein, May 14 2019

Keywords

Crossrefs

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

Formula

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