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, 0, 0, 0, 9, 11, 15, 18, 22, 25

Offset

1,5

Links

Table of n, a(n) for n=1..10.

Chris K. Caldwell and G. L. Honaker, Jr., Prime Curio for 18

Mike Keith, The Prime Queen Attacking Problem

Jacques Tramu, Le problème de Honaker résolu pour n=9, on Echolalie.

Jacques Tramu, Le problème de Honaker pour n=10.

Crossrefs

Cf. A001230.

Sequence in context: A270190 A320701 A287340 * A163096 A027694 A063191

Adjacent sequences: A037006 A037007 A037008 * A037010 A037011 A037012

Keyword

hard,nonn,more

Author

G. L. Honaker, Jr., Nov 15 1998

Extensions

a(9)-a(10) from Jacques Tramu, Mar 28 2004

Status

approved