1,1

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

I. Jensen, Table of n, a(n) for n = 1..19 [from the Jensen link below]

I. Jensen, Series Expansions for Self-Avoiding Walks

Cf. A000532, A001184, A121789, A215527.

Sequence in context: A262737 A299747 A300261 * A305587 A229294 A241813

Adjacent sequences: A121782 A121783 A121784 * A121786 A121787 A121788

nonn

N. J. A. Sloane, Aug 30 2006

approved