111712

Appears in sequences

• Number of simple Hamiltonian paths connecting opposite corners of a 2n+1 X 2n+1 grid.at n=3A001184
• "Crossing Hamiltonian walks" on the square lattice (see Jensen web site for further information).at n=5A121788
• Triangle read by rows: T(n,k) is the number of self-avoiding paths of length 2*(n-1+k) connecting opposite corners in the n X n grid graph (0 <= k <= floor((n-1)^2/2), n >= 1).at n=50A333520
• Number of Hamiltonian paths in a 7 X n grid starting at the lower left corner and finishing in the upper right corner.at n=6A333582