No-3-in-line problem on n X n grid: total number of ways of placing 2n points on n X n grid so no 3 are in a line. No symmetries are taken into account.
0, 1, 2, 11, 32, 50, 132, 380, 368, 1135, 1120, 4348, 3622, 10568, 30634, 46304
1 seqfan posts
Tue May 25 15:07:02 CEST 2010 [seqfan] A000769 No-3-in-line problem: number of ways of placing 2n points on n X n grid so no 3 are in a line.