id:A103315 - OEIS Search Results

Search: id:A103315

Displaying 1-1 of 1 results found.

page 1

Sequence A006075 gives minimal number of knights needed to cover an n X n board. This sequence gives total number of solutions using A006075(n) knights (compare A006076).

+0
5

1, 1, 8, 9, 47, 127, 10, 2, 2, 4, 800, 2, 152, 4, 504, 2, 212, 19562 (list; graph; listen)

	OFFSET	`1,3`
	LINKS	`Lee Morgenstern, Knight Domination`
	CROSSREFS	`Sequence in context: A048068 A037957 A165239 this_sequence A042847 A121330 A152189` `Adjacent sequences: A103312 A103313 A103314 this_sequence A103316 A103317 A103318`
	KEYWORD	`nonn`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com), Mar 20 2005, following a suggestion from Lee Morgenstern.`

page 1

Search completed in 0.002 seconds

Last modified December 16 17:18 EST 2009. Contains 170825 sequences.

AT&T Labs Research