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.
A000755
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.
Terms
- a(0) =0a(1) =1a(2) =2a(3) =11a(4) =32a(5) =50a(6) =132a(7) =380a(8) =368a(9) =1135a(10) =1120a(11) =4348a(12) =3622a(13) =10568a(14) =30634a(15) =46304a(16) =55576a(17) =152210
External references
- oeis: A000755