|
%I
%S 0,0,6,128,600,2688,7350,19968,42336,89600,163350,297600,490776,
%T 809088,1242150,1906688,2774400,4036608,5633766,7862400,10613400,
%U 14326400,18818646,24718848,31740000
%N Number of ways to place 3 nonattacking bishops on an n X n toroidal board
%H <a href="http://problem64.beda.cz/silo/kotesovec_non_attacking_chess_pieces_2010.pdf">Non-attacking chess pieces</a>, V. Kotesovec, 2010
%H V. Kotesovec, <a href="http://web.telecom.cz/vaclav.kotesovec/math.htm">Number of ways of placing non-attacking queens and kings on boards of various sizes</a>
%F Explicit formula (Vaclav Kotesovec, 12.5.2010): 1/12*(n-2)^2*n^2*(2n^2-4n+5+3(-1)^n), G.f.: -2x^3*(3x^8+58x^7+160x^6+518x^5+442x^4+518x^3+160x^2+58x+3)/((x-1)^7*(x+1)^5)
%Y Cf. A172124, A177755
%K nonn
%O 1,3
%A _Vaclav Kotesovec_, May 13 2010
|
