|
%I #19 May 17 2021 15:51:38
%S 2,9,80,1600,79033,8156736,2055960192,1108756350625,1411080429618656,
%T 3943472747846953216,25425527581172360096017,
%U 365481944233773616212640000,11980566143208960475692367828480,882106482533191605447029340350009049,147314997388032765439791110273770608260928
%N Number of ways to place k non-attacking ferses on an n x n cylindrical chessboard, summed over all k >= 0.
%C Fers is a leaper [1,1].
%H Vaclav Kotesovec, <a href="/A212271/b212271.txt">Table of n, a(n) for n = 1..18</a>
%H V. Kotesovec, <a href="https://oeis.org/wiki/User:Vaclav_Kotesovec">Non-attacking chess pieces</a>, 6ed, 2013, p.443
%F Limit n ->infinity (a(n))^(1/n^2) is the hard square entropy constant A085850.
%Y Cf. A067965, A067960, A182407, A212269, A212270.
%K nonn,hard
%O 1,1
%A _Vaclav Kotesovec_, May 12 2012
|
