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 A195648 #21 Aug 31 2024 15:02:32 %S A195648 5120,1501674,144605184,7683664202,282359109140,8080813574550, %T A195648 193194265398240,4035559337688370,75925129079783308, %U A195648 1314578079936797520,21279238303065874504,325878859655043000344,4765036384361599508980,67005992305769489072298,911373843678367079288192 %N A195648 Number of ways to place 9n nonattacking kings on a 18 x 2n chessboard. %H A195648 Alex V. Breger, <a href="/A195648/b195648.txt">Table of n, a(n) for n = 1..1000</a> %H A195648 Vaclav Kotesovec, <a href="https://oeis.org/wiki/User:Vaclav_Kotesovec">Non-attacking chess pieces</a> %H A195648 Vaclav Kotesovec, <a href="/A195648/a195648_1.txt">Generating function</a> %H A195648 <a href="/index/Rec#order_548">Index entries for linear recurrences with constant coefficients</a>, order 548. %F A195648 Recurrence order is 548. %Y A195648 Column k=9 of A350819. %Y A195648 Cf. A174558, A018807, A195653, A195658. %K A195648 nonn %O A195648 1,1 %A A195648 _Vaclav Kotesovec_, Sep 22 2011