|
%I #20 Jan 07 2023 18:09:52
%S 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,
%T 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
%N 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).
%C For further information see A274947, which is the main entry for this problem.
%e The triangle begins:
%e 1, 0,
%e 4, 0, 0, 0, 0,
%e 9, 2, 1, 0, 0, 0, 0, 0, 0, 0,
%e 16, 6, 3, 2, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
%e 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,
%e 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,
%e ...
%Y Cf. A247947, A250000.
%K nonn,tabf
%O 1,3
%A _N. J. A. Sloane_, Jul 27 2016
%E Corrections and more terms from _Andrey Zabolotskiy_, Jul 29 2016
|
