A079137 Number of (undirected) Hamiltonian paths on the 4 X n knight graph.
0, 0, 8, 0, 82, 744, 6378, 31088, 189688, 1213112, 6683852, 36486328, 201282470, 1083585304, 5706117458, 29819231288, 154430502724, 790787799376, 4014945695196, 20241304810488, 101336136490228, 504096313001272, 2493533648002492, 12270473056485396
Offset: 1
Keywords
References
- Kraitchik, M. Mathematical Recreations. New York: W. W. Norton, p. 263, 1942.
Links
- Andrew Howroyd, Table of n, a(n) for n = 1..500
- George Jellis, Knight's tour diagrams
- Colin Rose, Knight's tours
- Eric Weisstein's World of Mathematics, Hamiltonian Path
- Eric Weisstein's World of Mathematics, Knight Graph
Crossrefs
Extensions
More terms from André Pönitz (poenitz(AT)htwm.de), Jun 11 2003
Edited by N. J. A. Sloane, Oct 30 2006, following suggestions from Colin Rose
Terms a(22) and beyond from Andrew Howroyd, Jul 01 2017