|
Search: id:A037009
|
|
|
| A037009 |
|
Consider an n X n board with a knight's path, not necessarily closed, that visits every square exactly once; number the squares [ 1..n^2 ] along the path; a(n) = maximal number of prime numbered squares that can be attacked by a queen. |
|
+0
1
|
| |
|
|
Search completed in 0.002 seconds
|
