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 A195650 #18 Aug 31 2024 15:04:26 %S A195650 24576,18174084,3449705600,317076250136,18589546217696, %T A195650 803491953235264,27889602664055396,821112680030028632, %U A195650 21279238303065874504,498306336520679626558,10749154284380665611224,216711725342137199240416,4129262403388762742636600 %N A195650 Number of ways to place 11n nonattacking kings on a 22 x 2n chessboard. %H A195650 Alex V. Breger, <a href="/A195650/b195650.txt">Table of n, a(n) for n = 1..500</a> %H A195650 Vaclav Kotesovec, <a href="https://oeis.org/wiki/User:Vaclav_Kotesovec">Non-attacking chess pieces</a> %H A195650 Vaclav Kotesovec, <a href="/A195650/a195650.txt">Denominator of the generating function</a> %H A195650 <a href="/index/Rec#order_2321">Index entries for linear recurrences with constant coefficients</a>, order 2321. %F A195650 Recurrence order is 2321. %Y A195650 Column k=11 of A350819. %Y A195650 Cf. A018807, A195655, A195660. %K A195650 nonn %O A195650 1,1 %A A195650 _Vaclav Kotesovec_, Sep 22 2011