

A001366


Maximal number of unattacked squares with n queens on n X n board (answers for n >= 17 only probable).


3



0, 0, 0, 1, 3, 5, 7, 11, 18, 22, 30, 36, 47, 56, 72, 82, 97, 111, 132, 145, 170, 186, 216, 240, 260, 290, 324, 360, 381, 420
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,5


LINKS

Table of n, a(n) for n=1..30.
Yanan Jiang and Steven J. Miller, Generalizing RuthAaron Numbers, arXiv:2010.14990 [math.NT], 2020; published in The Pump Journal of Undergraduate Research, 4 (2021), 2062. [That paper references this sequence entry, probably by mistake; cf. A039752.]
Bernard Lemaire and Pavel Vitushinkiy, Placing n non dominating queens on the n X n chessboard. Part I, French Federation of Mathematical Games.
Bernard Lemaire and Pavel Vitushinkiy, Placing n non dominating queens on the n X n chessboard. Part II, French Federation of Mathematical Games.
Steven J. Miller, Haoyu Sheng, and Daniel Turek, When rooks miss: probability through chess, Williams College (2020).
Mario Velucchi, NONDominating Queens Problem
Eric Weisstein's World of Mathematics, Queens Problem.


CROSSREFS

Cf. A019317, A274947.
Sequence in context: A038944 A124081 A119573 * A093329 A246533 A111052
Adjacent sequences: A001363 A001364 A001365 * A001367 A001368 A001369


KEYWORD

nonn,more


AUTHOR

Mario Velucchi (mathchess(AT)velucchi.it)


STATUS

approved



