|
%I #19 Mar 26 2023 16:04:35
%S 5120,1501674,144605184,7683664202,282359109140,8080813574550,
%T 193194265398240,4035559337688370,75925129079783308,
%U 1314578079936797520,21279238303065874504,325878859655043000344,4765036384361599508980,67005992305769489072298,911373843678367079288192
%N Number of ways to place 9n nonattacking kings on a 18 x 2n chessboard.
%H Alex V. Breger, <a href="/A195648/b195648.txt">Table of n, a(n) for n = 1..1000</a>
%H Vaclav Kotesovec, <a href="https://oeis.org/wiki/User:Vaclav_Kotesovec">Non-attacking chess pieces</a>
%H Vaclav Kotesovec, <a href="/A195648/a195648_1.txt">Generating function</a>
%F Recurrence order is 548.
%Y Column k=9 of A350819.
%Y Cf. A174558, A018807, A195653, A195658.
%K nonn
%O 1,1
%A _Vaclav Kotesovec_, Sep 22 2011
| 