|
%I #7 Dec 15 2016 23:48:50
%S 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,
%T 16,16,16,16,16,0,17,22,23,24,24,24,24,24,25,25,25,25,25,25,25,25,25,
%U 25,25,25,25,25,25,25,25,0,20,26,30,30,32,32,34,34,34
%N 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.
%C A279405(n) is maximal m such that T(n,m) >= m.
%C Generally, T(n,k') <= n^2-k if and only if T(n,k) <= n^2-k'.
%H Andrey Zabolotskiy, <a href="http://pastebin.com/XgtJ6Bew">First 9 rows of the triangle and a part of row 10</a>
%F T(n,0) = 0.
%F T(n,k) = A000290(n) for k > A000290(n) - T(n,1).
%F T(n,1) = A047461(n) = A000290(n) - A279403(n,1).
%e The triangle begins:
%e 0 1
%e 0 4 4 4 4
%e 0 9 9 9 9 9 9 9 9 9
%e 0 12 14 15 15 16 16 16 16 16 16 16 16 16 16 16 16
%Y Cf. A000290, A250000, A274947, A274948, A279405, A279403.
%K nonn,tabf
%O 1,4
%A _Andrey Zabolotskiy_, Dec 11 2016
|
