2688307514

Appears in sequences

• Number of simple Hamiltonian paths connecting opposite corners of a 2n+1 X 2n+1 grid.at n=4A001184
• "Crossing Hamiltonian walks" on the square lattice (see Jensen web site for further information).at n=7A121788
• Number of Hamiltonian paths in a 9 X n grid starting at the lower left corner and finishing in the upper right corner.at n=8A333584