1,2

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. - njas, Nov 08 2004.

Lee Morgenstern, Knight Domination

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

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

nonn,tabl,nice

njas

Morgenstern's table extends a long way beyond what is shown here.