%I A075855
%S A075855 1,2,3,7,9,16,19,29,33
%N 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.
%F A075855 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).
%e A075855 For n=4, here is a path with 7 squares; the "x" is not visited:
%e A075855 1.3.
%e A075855 .2.4
%e A075855 7.5.
%e A075855 .6.x
%Y A075855 Sequence in context: A019312 A135369 A109660 this_sequence A140189 A165803 
               A007649
%Y A075855 Adjacent sequences: A075852 A075853 A075854 this_sequence A075856 A075857 
               A075858
%K A075855 nonn
%O A075855 1,2
%A A075855 Jon Perry (perry(AT)globalnet.co.uk), Oct 15 2002
%E A075855 Edited by Dean Hickerson (dean.hickerson(AT)yahoo.com), Oct 25 2002