id:A098604 - OEIS Search Results

Search: id:A098604

Displaying 1-1 of 1 results found.

page 1

Triangle T(n,k) read by rows, for 1 <= k <= n: minimal number of knights needed to cover a k X n board.

+0
3

1, 2, 4, 3, 4, 4, 4, 4, 4, 4, 5, 4, 4, 4, 5, 6, 4, 4, 4, 6, 8, 7, 6, 6, 6, 7, 8, 10, 8, 8, 8, 8, 8, 8, 11, 12, 9, 8, 8, 8, 8, 10, 12, 13, 14, 10, 8, 8, 8, 9, 12, 14, 14, 15, 16, 11, 8, 8, 8, 10, 12, 15, 16, 17, 19, 21, 12, 8, 8, 8, 10, 12, 16, 16, 18, 20, 22, 24, 13, 10, 10, 10, 12, 14 (list; table; graph; listen)

	OFFSET	`1,2`
	COMMENT	`How many knights are needed to occupy or attack every square of a k X n board?` `I do not know how many of these numbers have been proved to be optimal. - N. J. A. Sloane (njas(AT)research.att.com), Nov 08 2004.`
	LINKS	`Lee Morgenstern, Knight Domination`
	EXAMPLE	`Triangle begins:` `1` `2 4` `3 4 4` `4 4 4 4` `5 4 4 4 5` `6 4 4 4 6 8` `7 6 6 6 7 8 10`
	CROSSREFS	`See A006075 for the n X n case (the main diagonal). A006076 gives number of ways to cover an n X n board using the minimal number of knights.` `Sequence in context: A069655 A004574 A073127 this_sequence A083172 A104148 A089169` `Adjacent sequences: A098601 A098602 A098603 this_sequence A098605 A098606 A098607`
	KEYWORD	`nonn,tabl,nice`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com).`
	EXTENSIONS	`Morgenstern's table extends a long way beyond what is shown here.`

page 1

Search completed in 0.002 seconds

Last modified December 7 08:40 EST 2009. Contains 170430 sequences.

AT&T Labs Research