No-3-in-line problem: number of inequivalent ways of placing 2n points on an n X n grid so that no 3 are in a line.
A000769
No-3-in-line problem: number of inequivalent ways of placing 2n points on an n X n grid so that no 3 are in a line.
Terms
- a(0) =0a(1) =1a(2) =1a(3) =4a(4) =5a(5) =11a(6) =22a(7) =57a(8) =51a(9) =156a(10) =158a(11) =566a(12) =499a(13) =1366a(14) =3978a(15) =5900a(16) =7094a(17) =19204
External references
- oeis: A000769