|
%I #10 Mar 10 2019 13:23:40
%S 1,2,16,25,1,3,38,7,1,1,2,7,1,4,3,1
%N Place n queens on an n X n board so as to leave the maximal number of unattacked squares; sequence gives number of different solutions.
%H <a href="https://web.archive.org/web/20090226224221/http://www.cli.di.unipi.it/~velucchi/queens.txt">Source</a>
%Y Cf. A001366.
%K nonn
%O 1,2
%A Mario Velucchi (mathchess(AT)velucchi.it)
|
