

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 board = n^2  A274947(n,k).


3



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, 0, 36
(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..62.


EXAMPLE

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, 0
...


CROSSREFS

Cf. A247947, A250000.
Sequence in context: A276580 A108708 A290322 * A005925 A070206 A228368
Adjacent sequences: A274945 A274946 A274947 * A274949 A274950 A274951


KEYWORD

nonn,tabf,more


AUTHOR

N. J. A. Sloane, Jul 27 2016


EXTENSIONS

Corrections and more terms from Andrey Zabolotskiy, Jul 29 2016


STATUS

approved



