%I #21 Aug 31 2024 15:03:27
%S 11264,5266069,714611200,50123713793,2335042206624,82425144219429,
%T 2383116363555182,59315924213143597,1314578079936797520,
%U 26568150968269086211,498306336520679626558,8788579757709800395287,147246060712874767006100,2362334876238883501403023
%N Number of ways to place 10n nonattacking kings on a 20 x 2n chessboard.
%H Alex V. Breger, <a href="/A195649/b195649.txt">Table of n, a(n) for n = 1..500</a>
%H Vaclav Kotesovec, <a href="https://oeis.org/wiki/User:Vaclav_Kotesovec">Non-attacking chess pieces</a>
%H Vaclav Kotesovec, <a href="/A195649/a195649_1.txt">Generating function</a>
%H <a href="/index/Rec#order_1318">Index entries for linear recurrences with constant coefficients</a>, order 1318.
%F Recurrence order is 1318.
%Y Column k=10 of A350819.
%Y Cf. A018807, A195654, A195659.
%K nonn
%O 1,1
%A _Vaclav Kotesovec_, Sep 22 2011