login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A062166 Number of ways of placing n nonattacking torus queens on 2n+1 X 2n+1 board, similar solutions count only once. 0
1, 0, 1, 1, 0, 2, 7, 0, 26, 46, 0, 2861, 40303, 0, 6446047 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,6
COMMENTS
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).
The sequence reduces exactly the objects of A053994 and, via that sequence, these of A007705.
LINKS
M. Engelhardt, The N queens problem
CROSSREFS
Sequence in context: A282072 A282493 A355348 * A281673 A281847 A282206
KEYWORD
nonn,nice,more
AUTHOR
EXTENSIONS
Updated link that is transferred from people.freenet.de/nQueens to www.nqueens.de Matthias Engelhardt, Apr 21 2010
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 03:08 EDT 2024. Contains 371918 sequences. (Running on oeis4.)