|
| |
|
|
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.
|
|
0
| | |
|
|
|
OFFSET
| 1,2
|
|
|
FORMULA
| For n odd, a(n)=(n-1)^2/2+1. For n even, it is conjectured that a(n)=(n^2-n+2)/2 (it is easy to show this is a lower bound).
|
|
|
EXAMPLE
| For n=4, here is a path with 7 squares; the "x" is not visited:
1.3.
.2.4
7.5.
.6.x
|
|
|
CROSSREFS
| Sequence in context: A019312 A135369 A109660 * A140189 A165803 A204520
Adjacent sequences: A075852 A075853 A075854 * A075856 A075857 A075858
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Jon Perry (perry(AT)globalnet.co.uk), Oct 15 2002
|
|
|
EXTENSIONS
| Edited by Dean Hickerson (dean.hickerson(AT)yahoo.com), Oct 25 2002
|
| |
|
|
