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!)
A062168 Number of permutations with at most 2 queens on any torus diagonal, solutions similar on the torus count only once. 1
1, 0, 0, 1, 2, 3, 3, 19, 31, 328, 650, 14542, 37449, 771570 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,5
COMMENTS
As A062167, also this sequence counts classes of "near n-queens solutions". In this sequence, two permutations 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 if 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 contains the objects of A062165.
LINKS
M. Engelhardt, The N queens problem
CROSSREFS
Sequence in context: A090522 A114728 A057676 * A296836 A019229 A135353
KEYWORD
nonn,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 July 21 09:38 EDT 2024. Contains 374472 sequences. (Running on oeis4.)