|
%I #13 May 17 2021 03:32:35
%S 2,7,34,743,1546,598078,6027057,10163241031,242407820869
%N Number of ways to place k non-attacking knights on an n x n toroidal chessboard, summed over all k >= 0.
%H V. Kotesovec, <a href="https://oeis.org/wiki/User:Vaclav_Kotesovec">Non-attacking chess pieces</a>, 6ed, 2013, p.310
%Y Cf. A141243, A182407, A067958, A027683, A067960.
%K nonn,hard,more
%O 1,1
%A _Vaclav Kotesovec_, May 09 2012
|
