

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.


1



0, 0, 3, 0, 24, 1152, 0, 354, 436416, 2595450592, 0, 8138, 129422880
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,3


COMMENTS

The graph represents treetotree visibility in Euclid's orchard. It also appears in A247943, A247944, and A360062. Is there an established name for it?


LINKS



EXAMPLE

Triangle begins:
m\n 1 2 3 4 5
+
1  0
2  0 3
3  0 24 1152
4  0 354 436416 2595450592
5  0 8138 129422880 ? ?


CROSSREFS



KEYWORD



AUTHOR



STATUS

approved



