The definition of A769 says " No-3-in-line problem: ways of placing 2n points on n X n grid so no 3 are in a line." Does that include just the regular diagonals, or does it count (1,1), (2,3), (3,5) as being in a line? It could be either. (My earlier comment about using n-queens solutions assumed only 45-degree diagonals.