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 A195592 #16 Aug 17 2024 15:32:06
%S A195592 32,256,1220,4460,13932,39316,103508,259372,626780,1473764,3392964,
%T A195592 7682812,17166476,37942900,83115188,180699980,390351420,838619524,
%U A195592 1793087780,3817890076,8099228012,17125372436,36104600340,75916936300,159249370652,333329766436
%N A195592 Number of ways to place 4n nonattacking kings on a vertical cylinder 8 X 2n.
%C A195592 Vertical cylinder: a chessboard where it is supposed that the columns 1 and 8 are in contact (number of columns = 8, number of rows = 2n).
%H A195592 Ray Chandler, <a href="/A195592/b195592.txt">Table of n, a(n) for n = 1..3302</a>
%H A195592 V. Kotesovec, <a href="https://oeis.org/wiki/User:Vaclav_Kotesovec">Non-attacking chess pieces</a>
%H A195592 <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (7, -19, 25, -16, 4).
%F A195592 Recurrence: a(n) = 4*a(n-5) - 16*a(n-4) + 25*a(n-3) - 19*a(n-2) + 7*a(n-1).
%F A195592 G.f.: -(1 + 25*x + 51*x^2 + 11*x^3)/((x-1)^3*(2*x-1)^2).
%F A195592 a(n) = (221*n - 779)*2^n + 44*n^2 + 324*n + 780.
%t A195592 LinearRecurrence[{7,-19,25,-16,4},{32,256,1220,4460,13932},30] (* _Harvey P. Dale_, Jan 15 2016 *)
%Y A195592 Cf. A194646, A173782, A137432.
%K A195592 nonn
%O A195592 1,1
%A A195592 _Vaclav Kotesovec_, Sep 21 2011