

A279406


Irregular triangle read by rows: T(n,k) (n>=1, 0 <= k <= n^2) = minimal number of squares attacked by k queens on an n X n toroidal board.


2



0, 1, 0, 4, 4, 4, 4, 0, 9, 9, 9, 9, 9, 9, 9, 9, 9, 0, 12, 14, 15, 15, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 0, 17, 22, 23, 24, 24, 24, 24, 24, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 0, 20, 26, 30, 30, 32, 32, 34, 34, 34
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,4


COMMENTS

A279405(n) is maximal m such that T(n,m) >= m.
Generally, T(n,k') <= n^2k if and only if T(n,k) <= n^2k'.


LINKS



FORMULA

T(n,0) = 0.


EXAMPLE

The triangle begins:
0 1
0 4 4 4 4
0 9 9 9 9 9 9 9 9 9
0 12 14 15 15 16 16 16 16 16 16 16 16 16 16 16 16


CROSSREFS



KEYWORD

nonn,tabf


AUTHOR



STATUS

approved



