cp's OEIS Frontend

A360063 Triangle read by rows: T(m,n) is the number of Hamiltonian cycles in the graph whose nodes are the integer lattice points (x,y) with 0 <= x < m and 0 <= y < n, and with an edge between two nodes if there is no other integer lattice point on the line segment between them; 1 <= n <= m.