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 A195652 #16 Aug 28 2024 13:09:09 %S A195652 2304,9476,47058,259372,1536814,9643562,63558566,437500380,3130270224, %T A195652 23174548666,176740657340,1382652697282,11052082053262,89954475408222, %U A195652 743275585245898,6219118726337532,52583297643941856,448492643088144992,3853319870967662784 %N A195652 Number of ways to place 8n nonattacking kings on a 16 X 2n cylindrical chessboard. %C A195652 This cylinder is horizontal: a chessboard where it is supposed that rows 1 and 2n are in contact (number of columns = 16, number of rows = 2n). %H A195652 Alex V. Breger, <a href="/A195652/b195652.txt">Table of n, a(n) for n = 1..1000</a> %H A195652 Artem M. Karavaev, <a href="http://zealint.ru/koroli-na-cilindricheskoj-doske-predlozhenie.html">Zealint blog</a> (in Russian) %H A195652 V. Kotesovec, <a href="https://oeis.org/wiki/User:Vaclav_Kotesovec">Non-attacking chess pieces</a> %H A195652 Vaclav Kotesovec, <a href="/A195652/a195652.txt">Generating function</a> %H A195652 <a href="/index/Rec#order_208">Index entries for linear recurrences with constant coefficients</a>, order 208. %F A195652 Recurrence order is 208. %Y A195652 Cf. A137432, A174558, A195657. %K A195652 nonn %O A195652 1,1 %A A195652 _Vaclav Kotesovec_, Sep 22 2011