A068941 Maximum number of chess queens that can be placed on a 4-dimensional chessboard of order n so that no two attack each other.

1, 1, 6, 16, 38, 80, 145

Offset

1,3

Links

Table of n, a(n) for n=1..7.

Alexis Langlois-Rémillard, Christoph Müßig, and Érika Róldan, Complexity of Chess Domination Problems, arXiv:2211.05651 [math.CO], 2022.

Al Zimmermann, Attacking Queens Programming Contest

Al Zimmermann, Attacking Queens Programming Contest Results

Al Zimmermann, Attacking Queens Programming Contest Database [broken link?]

Crossrefs

Cf. A068940.

Sequence in context: A058272 A049712 A092274 * A130902 A300371 A009955

Adjacent sequences: A068938 A068939 A068940 * A068942 A068943 A068944

Keyword

nonn,more

Author

Al Zimmermann, Mar 08 2002

Extensions

a(5) from Alexis Langlois-Rémillard, Christoph Müßig and Érika Roldán added by Christoph Muessig, Nov 11 2022

a(6)-a(7) from Alexis Langlois-Rémillard, Christoph Müßig and Érika Roldán added by Christoph Muessig, Apr 02 2023

Status

approved