A lattice triangulation is a triangulation all whose vertices are at points with integer coordinates. It is primitive if each triangle is primitive, i.e. of area 1/2. Let f(m,n) be the number of primitive triangulations of an m x n rectangle. In the following files we give the exact values of these numbers for some m,n. The file named mxnf.txt contains a list

{f(m,1), f(m,2), ..... , f(m,n)}

3x600f.txt
4x200f.txt
5x115f.txt
6x50f.txt
7x20f.txt
8x13f.txt
9x9f.txt