This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A062166 #7 Mar 30 2012 18:59:35
%S A062166 1,0,1,1,0,2,7,0,26,46,0,2861,40303,0,6446047
%N A062166 Number of ways of placing n nonattacking torus queens on 2n+1 X 2n+1 board, similar solutions count only once.
%C A062166 Two n-queens solutions p and q are considered similar iff there is a factor f, 0 < f < n, satisfying gcd (f,n) = 1, such that for all k from {0, ..., n-1} q (k * f mod n) = p (k) * f mod n or q is a rotation, a reflection or a shift of such a q. In other words, also expansions are allowed which move the queen at (k, p(k)) to (f * k mod n, f * p(k) mod n).
%C A062166 The sequence reduces exactly the objects of A053994 and, via that sequence, these of A007705.
%H A062166 M. Engelhardt, <a href="http://www.nqueens.de">The N queens problem</a>
%K A062166 nonn,nice,more
%O A062166 1,6
%A A062166 _Matthias Engelhardt_
%E A062166 Updated link that is transferred from people.freenet.de/nQueens to www.nqueens.de _Matthias Engelhardt_, Apr 21 2010