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 A062167 #6 Mar 30 2012 18:59:35
%S A062167 1,0,0,1,2,3,5,29,93,569,3226,28630,221250,2314650
%N A062167 Number of permutations with at most 2 queens on any torus diagonal, solutions congruent on the torus count only once.
%C A062167 This sequence counts classes of "near n-queens solutions". Permutations with at most 1 queen on any torus diagonal are exactly the torus n queen solutions (A007705), those with at most 2 contain the normal n queen solutions (A000170).
%C A062167 Therefore they may be called "near n-queens solutions". In this sequence, permutations p and q are considered equivalent iff there are natural x and y, such that, for all k from {0, ..., n-1}, q (k + x mod n) = p (k) + y mod n, or q is a rotation or a reflection of such a q. In other words, rotations, reflections and torus shifts are allowed. The sequence contains the objects of A062164.
%H A062167 M. Engelhardt, <a href="http://www.nqueens.de">The N queens problem</a>
%K A062167 nonn,more
%O A062167 1,5
%A A062167 _Matthias Engelhardt_
%E A062167 Updated link that is transferred from people.freenet.de/nQueens to www.nqueens.de _Matthias Engelhardt_, Apr 21 2010