This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A352599 #18 Apr 01 2022 01:23:20 %S A352599 1,2,4,6,2,6,64,112,68,80,32,36,28,1414,576,384,40,70396,40896,22468, %T A352599 9808,1152,252,2246138,482272,185932 %N A352599 Number of ways of placing A352426(n) nonattacking white-square queens on an n X n board. %C A352599 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. %F A352599 a(2n) = A352325(2n). %o A352599 (Python) See A352426. %Y A352599 Cf. A352241 (maximal number for black-squares), A352325 (black-squares counts), A352426 (maximal number for white-squares), this sequence (white-squares counts). %K A352599 nonn,hard,more %O A352599 1,2 %A A352599 _Martin Ehrenstein_, Mar 22 2022 %E A352599 a(21)-a(24) from _Vaclav Kotesovec_, Mar 23 2022 %E A352599 a(25)-a(26) from _Vaclav Kotesovec_, Apr 01 2022