|
Search: id:A062166
|
|
|
| A062166 |
|
Number of ways of placing n nonattacking torus queens on 2n+1 X 2n+1 board, similar solutions count only once. |
|
+0
1
|
|
| 1, 0, 1, 1, 0, 2, 7, 0, 26, 46, 0, 2861, 40303, 0, 6446047
(list; graph; listen)
|
|
|
OFFSET
|
1,6
|
|
|
LINKS
|
M. Engelhardt, The N queens problem
|
|
CROSSREFS
|
Sequence in context: A021791 A016638 A011294 this_sequence A113651 A021373 A011047
Adjacent sequences: A062163 A062164 A062165 this_sequence A062167 A062168 A062169
|
|
KEYWORD
|
nonn,nice,more
|
|
AUTHOR
|
Matthias Engelhardt (Matthias.R.Engelhardt(AT)web.de)
|
|
EXTENSIONS
|
In this sequence, 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.
|
|
|
Search completed in 0.002 seconds
|
