Maximum number of black squares on an n X n chessboard (with a black square in at least one corner) that can be covered by a single path, traveling only to adjacent black squares.
A075855
Maximum number of black squares on an n X n chessboard (with a black square in at least one corner) that can be covered by a single path, traveling only to adjacent black squares.
Terms
- a(0) =1a(1) =2a(2) =3a(3) =7a(4) =9a(5) =16a(6) =19a(7) =29a(8) =33
External references
- oeis: A075855