login
A352662
Number of singly symmetric characteristic solutions to the n-superqueens problem.
3
0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 2, 6, 11, 49, 79, 245, 498, 1192, 3798, 11594
OFFSET
1,12
COMMENTS
Superqueens are also called amazons. They combine the moves of queen and knight.
REFERENCES
D. E. Knuth, The Art of Computer Programming, Section 7.2.2.3 (draft, March 2022).
EXAMPLE
For n=10 the a(10)=1 solution is
+---------------------+
| . . . A . . . . . . |
| . . . . . . . A . . |
| A . . . . . . . . . |
| . . . . A . . . . . |
| . . . . . . . . A . |
| . A . . . . . . . . |
| . . . . . A . . . . |
| . . . . . . . . . A |
| . . A . . . . . . . |
| . . . . . . A . . . |
+---------------------+
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Don Knuth, Mar 25 2022
STATUS
approved