A182408 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A182408

Number of ways to place k non-attacking knights on an n x n toroidal chessboard, summed over all k >= 0.

%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