Tim Kunt - cp's OEIS frontend

User: Tim Kunt

Tim Kunt's wiki page.

Tim Kunt has authored 2 sequences.

A375104 Number of ways of placing the maximum number of nonattacking queens on a 4-dimensional chessboard of order n.

Original entry on oeis.org

1, 16, 4992, 404564

Offset: 1

Tim Kunt, Jul 30 2024

Tim Kunt, The n-Queens Problem in Higher Dimensions.
Eric Weisstein's World of Mathematics, Maximum Independent Vertex Set.

Cf. A000170, A068941, A375103.

A375103 Number of ways of placing the maximum number of nonattacking queens on a 3-dimensional chessboard of order n.

Original entry on oeis.org

1, 8, 16, 1344, 1056, 912, 96, 24

Offset: 1

Tim Kunt, Jul 30 2024

Tim Kunt, The n-Queens Problem in Higher Dimensions, arXiv:2406.06260 [math.OC], 2024.
Eric Weisstein's World of Mathematics, Maximum Independent Vertex Set.

Cf. A000170, A068940, A375104.

a(8) from Tim Kunt, Aug 12 2024