Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Number of ways to place k non-attacking knights on an n x n cylindrical chessboard, summed over all k >= 0.
5

%I #15 May 17 2021 15:49:06

%S 2,9,34,982,11284,1048768,48027971,23807996588,3430123782371,

%T 8141109957322587,4098570575535958632,46676507893324203092812,

%U 77374614378004006943995980,4352639823147918661142120756677

%N Number of ways to place k non-attacking knights on an n x n cylindrical 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.307

%Y Cf. A141243, A182408, A172964.

%K nonn,hard

%O 1,1

%A _Vaclav Kotesovec_, May 09 2012

%E a(14) from _Vaclav Kotesovec_, May 17 2021