A274948 - OEIS

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

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,3

COMMENTS

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

LINKS

Table of n, a(n) for n=1..60.

EXAMPLE

The triangle begins:

1, 0,

4, 0, 0, 0, 0,

9, 2, 1, 0, 0, 0, 0, 0, 0, 0,