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 A195595 #14 Aug 17 2024 15:46:33 %S A195595 256,6060,58776,358564,1649420,6286658,20984924,63558566,178909300, %T A195595 476033636,1212120160,2980927200,7129922604,16675350430,38293956836, %U A195595 86629645122,193553210580,427974677968,938053730248,2040792091884,4411561365324,9483844861978 %N A195595 Number of ways to place 7n nonattacking kings on a vertical cylinder 14 X 2n. %C A195595 Vertical cylinder: a chessboard where it is supposed that the columns 1 and 14 are in contact (number of columns = 14, number of rows = 2n). %H A195595 Ray Chandler, <a href="/A195595/b195595.txt">Table of n, a(n) for n = 1..3292</a> %H A195595 V. Kotesovec, <a href="https://oeis.org/wiki/User:Vaclav_Kotesovec">Non-attacking chess pieces</a> %H A195595 <a href="/index/Rec#order_08">Index entries for linear recurrences with constant coefficients</a>, signature (10, -43, 104, -155, 146, -85, 28, -4). %F A195595 Recurrence: a(n) = -4*a(n-8) + 28*a(n-7) - 85*a(n-6) + 146*a(n-5) - 155*a(n-4) + 104*a(n-3) - 43*a(n-2) + 10*a(n-1). %F A195595 G.f.: (1 + 246*x + 3543*x^2 + 9080*x^3 + 4915*x^4 + 442*x^5 + 15*x^6)/((x-1)^6*(2*x-1)^2). %F A195595 a(n) = (157823*n - 1211433)*2^n + 9121/60*n^5 + 35581/12*n^4 + 352625/12*n^3 + 2179835/12*n^2 + 20456597/30*n + 1211434. %Y A195595 Cf. A195004, A174155, A137432. %K A195595 nonn %O A195595 1,1 %A A195595 _Vaclav Kotesovec_, Sep 21 2011