No-3-in-line problem: number of inequivalent ways of placing 2n points on n X n grid so no 3 are in a line.
0, 1, 1, 4, 5, 11, 22, 57, 51, 156, 158, 566, 499, 1366, 3978, 5900, 7094, 1920
3 seqfan posts
Tue May 25 19:29:31 CEST 2010 [seqfan] Re: 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.
Tue May 25 19:29:31 CEST 2010 [seqfan] Re: 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.
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.
Index of A-numbers in seqfan: by ascending order
by month
by frequency
by keyword
Links to OEIS content are included according to
The OEIS End-User License Agreement
.