%I A037009
%S A037009 0,0,0,0,9,11,15,18,22,25
%N 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.
%H A037009 Echolalie, <a href="http://mapage.noos.fr/echolalie/q9.htm">Le Probleme 
               de Honaker resolu pour n=9</a>
%H A037009 M. Keith, <a href="http://users.aol.com/s6sj7gt/primeq.htm">The Prime 
               Queen Attacking Problem</a>
%H A037009 J. Tramu, <a href="http://mapage.noos.fr/echolalie/q9.htm">Le probleme 
               de Honaker</a>.
%H A037009 J. Tramu, <a href="http://www.echolalie.com/q10.htm">Le probleme de Honaker</
               a>.
%Y A037009 Cf. A001230.
%Y A037009 Sequence in context: A044873 A101754 A113339 this_sequence A163096 A027694 
               A063191
%Y A037009 Adjacent sequences: A037006 A037007 A037008 this_sequence A037010 A037011 
               A037012
%K A037009 hard,nonn
%O A037009 1,5
%A A037009 G. L. Honaker, Jr. (honak3r(AT)gmail.com), Nov 15 1998
%E A037009 a(9) and a(10) from Jacques Tramu (jacques.tramu(AT)echolalie.com), Mar 
               28 2004