OFFSET
1,1
COMMENTS
Number of Hamiltonian paths in the graph P_{n+1} X P_{n+1} starting at any of the n+1 vertices on one side of the graph and terminating at any of the n+1 vertices on the opposite side. - Andrew Howroyd, Apr 10 2016
LINKS
Anthony J. Guttmann and Iwan Jensen, Table of n, a(n) for n = 1..26
Anthony J. Guttmann and Iwan Jensen, Self-avoiding walks and polygons crossing a domain on the square and hexagonal lattices, arXiv:2208.06744 [math-ph], Aug 13 2022, table D1.
I. Jensen, Series Expansions for Self-Avoiding Walks
I. Jensen, Spanning walks (terms)
CROSSREFS
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Aug 30 2006
STATUS
approved