login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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, 0, 9, 11, 15, 18, 22, 25 (list; graph; refs; listen; history; text; internal format)
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

M. Keith, The Prime Queen Attack Problem

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

J. 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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 18 15:00 EDT 2019. Contains 326106 sequences. (Running on oeis4.)