%I A019317
%S A019317 1,2,16,25,1,3,38,7,1,1,2,7,1,4,3,1
%N A019317 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 A019317 <a href="http://www.cli.di.unipi.it/~velucchi/queens.txt">Source</a>
%Y A019317 Cf. A001366.
%Y A019317 Sequence in context: A093026 A118954 A119599 this_sequence A067566 A067555 
               A108705
%Y A019317 Adjacent sequences: A019314 A019315 A019316 this_sequence A019318 A019319 
               A019320
%K A019317 nonn
%O A019317 1,2
%A A019317 Mario Velucchi (mathchess(AT)velucchi.it)