A274948 Irregular triangle read by rows: T(n,k) (n>=1, 0 <= k <= n^2) = maximal number of squares not attacked by any arrangement of k queens on an n X n board = n^2 - A274947(n,k).

1, 0, 4, 0, 0, 0, 0, 9, 2, 1, 0, 0, 0, 0, 0, 0, 0, 16, 6, 3, 2, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 25, 12, 7, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0

Offset: 1

Author

N. J. A. Sloane, Jul 27 2016

Keywords

• nonn
• tabf

Comments

For further information see A274947, which is the main entry for this problem.

Examples

			The triangle begins:
1, 0,
4, 0, 0, 0, 0,
9, 2, 1, 0, 0, 0, 0, 0, 0, 0,
16, 6, 3, 2, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
25, 12, 7, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
36, 20, 13, 9, 8, 6, 5, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
...
		

Crossrefs

Cf. A247947, A250000.

Extensions

Corrections and more terms from Andrey Zabolotskiy, Jul 29 2016