id:A037009 - OEIS Search Results

Search: id:A037009

Displaying 1-1 of 1 results found.

page 1

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
1

0, 0, 0, 0, 9, 11, 15, 18, 22, 25 (list; graph; listen)

	OFFSET	`1,5`
	LINKS	`Echolalie, Le Probleme de Honaker resolu pour n=9` `M. Keith, The Prime Queen Attacking Problem` `J. Tramu, Le probleme de Honaker.` `J. Tramu, Le probleme de Honaker.`
	CROSSREFS	`Cf. A001230.` `Adjacent sequences: A037006 A037007 A037008 this_sequence A037010 A037011 A037012` `Sequence in context: A044873 A101754 A113339 this_sequence A027694 A063191 A048464`
	KEYWORD	`hard,nonn`
	AUTHOR	`G. L. Honaker, Jr. (honak3r(AT)bvunet.net), Nov 15 1998`
	EXTENSIONS	`a(9) and a(10) from Jacques Tramu (jacques.tramu(AT)echolalie.com), Mar 28 2004`

page 1

Search completed in 0.002 seconds

Last modified July 4 09:27 EDT 2009. Contains 160562 sequences.

AT&T Labs Research