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 A133143 #22 Dec 03 2024 19:55:32 %S A133143 1,1,1,2,4,4,5,6,8,10,11,12,13,14,15,16,17,18,19,20 %N A133143 Maximal number of mutually nonattacking Super Queens on an n X n board. (A Super Queen is a queen with both queen and knight powers.) %C A133143 From _Vaclav Kotesovec_, Mar 14 2011: (Start) %C A133143 For n >= 10, a(n)=n, see A051223. %C A133143 For same problem on a toroidal chessboard the results for n > 10 are the same as for queens (A085801). (End) %H A133143 Bill Butler, <a href="http://www.durangobill.com/N_Queens.html">More Information</a> %H A133143 Rachit Agrawal, <a href="/A133143/a133143.txt">Java code for this sequence</a> %e A133143 a(4) = 2: %e A133143 |X|0|0|0| %e A133143 |0|0|0|X| %e A133143 |0|0|0|0| %e A133143 |0|0|0|0| %e A133143 where X denotes the place of a Super Queen. %o A133143 (Java) // See Java code text file in the links section. %K A133143 nonn %O A133143 1,4 %A A133143 Rachit Agrawal (rachit_agrawal(AT)daiict.ac.in), Dec 16 2007