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 A182407 #15 May 17 2021 15:49:06 %S A182407 2,9,34,982,11284,1048768,48027971,23807996588,3430123782371, %T A182407 8141109957322587,4098570575535958632,46676507893324203092812, %U A182407 77374614378004006943995980,4352639823147918661142120756677 %N A182407 Number of ways to place k non-attacking knights on an n x n cylindrical chessboard, summed over all k >= 0. %H A182407 V. Kotesovec, <a href="https://oeis.org/wiki/User:Vaclav_Kotesovec">Non-attacking chess pieces</a>, 6ed, 2013, p.307 %Y A182407 Cf. A141243, A182408, A172964. %K A182407 nonn,hard %O A182407 1,1 %A A182407 _Vaclav Kotesovec_, May 09 2012 %E A182407 a(14) from _Vaclav Kotesovec_, May 17 2021