A352599 Number of ways of placing A352426(n) nonattacking white-square queens on an n X n board.

1, 2, 4, 6, 2, 6, 64, 112, 68, 80, 32, 36, 28, 1414, 576, 384, 40, 70396, 40896, 22468, 9808, 1152, 252, 2246138, 482272, 185932

Offset: 1

Author

Martin Ehrenstein, Mar 22 2022

Keywords

• nonn
• hard
• more

Comments

Equivalently the number of ways of placing the maximal number of nonattacking black-square queens on an inverted n X n chessboard, that is a board with the a1 square white, the a2 and b1 squares black, etc.

Crossrefs

Cf. A352241 (maximal number for black-squares), A352325 (black-squares counts), A352426 (maximal number for white-squares), this sequence (white-squares counts).

Programs

Python

See A352426.

Formula

a(2n) = A352325(2n).

Extensions

a(21)-a(24) from Vaclav Kotesovec, Mar 23 2022

a(25)-a(26) from Vaclav Kotesovec, Apr 01 2022