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 A195653 #16 Aug 28 2024 13:03:19 %S A195653 5120,21508,109796,626780,3877300,25603228,178909300,1314748124, %T A195653 10105541204,80812754568,668845118276,5700499630916,49800720887968, %U A195653 444140848321356,4029482453905756,37080781799409148,345278411878468044,3246772078088155432,30781946900321278256 %N A195653 Number of ways to place 9n nonattacking kings on an 18 X 2n cylindrical chessboard. %C A195653 This cylinder is horizontal: a chessboard where it is supposed that rows 1 and 2n are in contact (number of columns = 18, number of rows = 2n). %H A195653 Alex V. Breger, <a href="/A195653/b195653.txt">Table of n, a(n) for n = 1..1000</a> %H A195653 Artem M. Karavaev, <a href="http://zealint.ru/koroli-na-cilindricheskoj-doske-predlozhenie.html">Zealint blog</a> (in Russian) %H A195653 V. Kotesovec, <a href="https://oeis.org/wiki/User:Vaclav_Kotesovec">Non-attacking chess pieces</a> %H A195653 Vaclav Kotesovec, <a href="/A195653/a195653.txt">Generating function</a> %H A195653 <a href="/index/Rec#order_400">Index entries for linear recurrences with constant coefficients</a>, order 400. %F A195653 Recurrence order is 400. %Y A195653 Cf. A137432, A195648, A195658. %K A195653 nonn %O A195653 1,1 %A A195653 _Vaclav Kotesovec_, Sep 22 2011