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 A343907 #18 May 04 2021 09:49:01 %S A343907 4,10,16,28,36,52,64,82,100 %N A343907 a(n) is the least s > 1 for which it is possible to place s nonattacking range-n leprechauns on an s X s board. %C A343907 A range-n leprechaun is a fairy chess piece that can move to any square within range n, and to any square that a queen can move to. A range-1 leprechaun is a queen and a range-2 leprechaun is a superqueen. (Escamocher and O'Sullivan 2021) %H A343907 Guillaume Escamocher and Barry O'Sullivan, <a href="https://doi.org/10.1016/j.disc.2021.112316">Leprechauns on the chessboard</a>, Discrete Mathematics, 344(5), 2021. %F A343907 If n is odd, a(n) = (n+1)^2. If n is even, a(n) > (n+1)^2. (Escamocher and O'Sullivan 2021) %Y A343907 Cf. A343905. %K A343907 nonn,more %O A343907 1,1 %A A343907 _Guillaume Escamocher_, May 03 2021