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!)
A062165 Number of ways of placing n nonattacking (normal) queens on n X n board, solutions similar on the torus count only once. 1
1, 0, 0, 1, 1, 1, 3, 4, 13, 36, 115, 813, 3083, 21001, 131859, 868613 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,7
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 A062164 and, via that sequence, these of A002562 and A000170. Note that the equivalence classes of this sequence are a subset of A062168.
LINKS
M. Engelhardt, The N queens problem
CROSSREFS
Sequence in context: A286917 A084315 A194649 * A243764 A201821 A001056
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 18 20:26 EDT 2024. Contains 371781 sequences. (Running on oeis4.)