|
Search: id:A000755
|
|
|
| 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.
(Formerly M1997 N0788)
|
|
+0
3
|
|
| 0, 1, 2, 11, 32, 50, 132, 380, 368, 1135, 1120, 4348, 3622, 10568, 30634, 46304, 55576, 152210
(list; graph; listen)
|
|
|
Search completed in 0.002 seconds
|
