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 A037009 #41 Oct 07 2023 21:40:48 %S A037009 0,0,0,0,9,11,15,18,22,25 %N A037009 Consider an n X n board with a knight's path, not necessarily closed, that visits every square exactly once; number the squares [ 1..n^2 ] along the path; a(n) = maximal number of prime numbered squares that can be attacked by a queen. %H A037009 Chris K. Caldwell and G. L. Honaker, Jr., <a href="https://t5k.org/curios/page.php?curio_id=549">Prime Curio for 18</a> %H A037009 Mike Keith, <a href="http://www.cadaeic.net/primeq.htm">The Prime Queen Attacking Problem</a> %H A037009 Jacques Tramu, <a href="http://mapage.noos.fr/echolalie/q9.htm">Le problème de Honaker résolu pour n=9</a>, on Echolalie. %H A037009 Jacques Tramu, <a href="http://www.echolalie.com/q10.htm">Le problème de Honaker pour n=10</a>. %Y A037009 Cf. A001230. %K A037009 hard,nonn,more %O A037009 1,5 %A A037009 _G. L. Honaker, Jr._, Nov 15 1998 %E A037009 a(9)-a(10) from _Jacques Tramu_, Mar 28 2004