A177759 -id:A177759 - cp's OEIS frontend

A178140 Number of ways to place 7 nonattacking bishops on an n X n toroidal board.

0, 0, 0, 0, 0, 0, 5040, 589824, 6531840, 98304000, 548856000, 3822059520, 14841066240, 67711795200, 208702494000, 726855843840, 1906252508160, 5500708061184, 12796310741760, 32142458880000, 68146033536000

Offset: 1

Vaclav Kotesovec, May 21 2010

Vincenzo Librandi, Table of n, a(n) for n = 1..1000
V. Kotesovec, Non-attacking chess pieces, 6ed, 2013
Index entries for linear recurrences with constant coefficients, signature (2, 12, -26, -65, 156, 208, -572, -429, 1430, 572, -2574, -429, 3432, 0, -3432, 429, 2574, -572, -1430, 429, 572, -208, -156, 65, 26, -12, -2, 1).

Cf. A177755, A177756, A177757, A177758, A177759, A176886.

CoefficientList[Series[- 48 x^6 (105 x^20 + 32558 x^19 + 69284 x^18 + 2532234 x^17 + 4270573 x^16 + 43976860 x^15 + 59687712 x^14 + 262529316 x^13 + 264238506 x^12 + 619225992 x^11 + 438942840 x^10 + 606753672 x^9 + 289183146 x^8 + 243462436 x^7 + 72876832 x^6 + 36501660 x^5 + 6031853 x^4 + 1631114 x^3 + 110244 x^2 + 12078 x + 105) / ((x - 1)^15 (x + 1)^13), {x, 0, 50}], x] (* Vincenzo Librandi, May 31 2013 *)

Explicit formula (Vaclav Kotesovec, May 21 2010): (1/10080)*(n-6)^2*(n-4)^2*(n-2)^2*(n^2) * (2*n^6 -36*n^5 +275*n^4 -1224*n^3 +3887*n^2 -9570*n +14625 +(21*n^4 -336*n^3 +2289*n^2 -8190*n +14175)*(-1)^n).

G.f.: -48*x^7 * (105*x^20 +32558*x^19 +69284*x^18 +2532234*x^17 +4270573*x^16 +43976860*x^15 +59687712*x^14 +262529316*x^13 +264238506*x^12 +619225992*x^11 +438942840*x^10 +606753672*x^9 +289183146*x^8 +243462436*x^7 +72876832*x^6 +36501660*x^5 +6031853*x^4 +1631114*x^3 +110244*x^2 +12078*x +105) / ((x-1)^15*(x+1)^13).

A189789 Number of ways to place 8 nonattacking bishops on an n x n toroidal board.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 147456, 3265920, 129024000, 1097712000, 12939264000, 66784798080, 436483031040, 1669619952000, 7629571031040, 23828156352000, 85476013572096, 230333593351680, 693478195200000, 1669577821632000

Offset: 1

Vaclav Kotesovec, Apr 27 2011

nonn

Bruno Berselli, Table of n, a(n) for n = 1..5000
V. Kotesovec, Number of ways of placing non-attacking queens, kings, bishops and knights (in English and Czech)
Index entries for linear recurrences with constant coefficients, signature (2, 14, -30, -90, 210, 350, -910, -910, 2730, 1638, -6006, -2002, 10010, 1430, -12870, 0, 12870, -1430, -10010, 2002, 6006, -1638, -2730, 910, 910, -350, -210, 90, 30, -14, -2, 1).

Cf. A177755, A177756, A177757, A177758, A177759, A178140, A187240

(* Number of ways to place k nonattacking bishops on an n x n toroidal board *)
tbishops[k_,n_]:=If[EvenQ[n],2^k*k!*Sum[Binomial[n/2,i]^2*Binomial[n/2,k-i]^2/Binomial[k,i],{i,0,k}],k!*Binomial[n,k]^2];
Table[tbishops[8,n],{n,1,20}] (* using k=8 for this sequence *)

a(n) = (1/80640) * (n-6)^2 * (n-4)^2 * (n-2)^2 * n^2 * (2*n^8 - 64*n^7 + 884*n^6 - 7048*n^5 + 37382*n^4 - 147904*n^3 + 468540*n^2 - 1108800*n + 1422225 + (28*n^6 - 840*n^5 + 10906*n^4 - 80640*n^3 + 370468*n^2 - 1034880*n + 1400175) * (-1)^n)

G.f.: 1152x^8*(35x^23 + 21178x^22 + 27889x^21 + 2133348x^20 + 3081175x^19 + 51948910x^18 + 72476645x^17 + 469213640x^16 + 538879520x^15 + 1803221880x^14 + 1580004720x^13 + 3146148264x^12 + 2014875632x^11 + 2544618104x^10 + 1144092320x^9 + 933224520x^8 + 278242005x^7 + 143723790x^6 + 25756935x^5 + 7854820x^4 + 693025x^3 + 104538x^2 + 2579x + 128) / ((1-x)^17*(x+1)^15)

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

Original entry on oeis.org

2, 9, 34, 289, 1546, 19321, 130922, 2169729, 17572114, 364466281, 3405357682, 85143154849, 896324308634, 26309790300249, 306827170866106, 10366719612433921, 132240988644215842, 5064730099043043529, 69974827707903049154, 3000912883089564050721

Offset: 1

Vaclav Kotesovec, Aug 28 2012

nonn

a(n) = A002720(n) if n is odd.

Vaclav Kotesovec, Table of n, a(n) for n = 1..440
V. Kotesovec, Non-attacking chess pieces

Cf. A002720, A201862, A010790, A177755-A177759, A178140, A189789, A189790, A189791.

Table[Sum[If[EvenQ[n],2^k*k!*Sum[Binomial[n/2,i]^2*Binomial[n/2,k-i]^2/Binomial[k,i],{i,0,k}],Binomial[n,k]^2*k!],{k,0,n}],{n,1,25}]

Recurrence: a(n) = ((12*n^5 - 158*n^4 - (6*(-1)^n-706)*n^3 - (1193-41*(-1)^n)*n^2 - 8*(7*(-1)^n-72)*n - 22*(-1)^n-28)*a(n-2) + (-12*n^6 + 206*n^5 + 2*(7*(-1)^n-691)*n^4 + (4545-137*(-1)^n)*n^3 + (442*(-1)^n-7442)*n^2 + (5194-544*(-1)^n)*n + 198*(-1)^n-698)*(n-2)*a(n-4) + 2*(2*n-1)*(n^2-7*n+10)^2*(n-4)^4*a(n-6))/(2*(n-5)^2*(2*n-5)).

cp's OEIS Frontend

A178140 Number of ways to place 7 nonattacking bishops on an n X n toroidal board.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

Formula

A189789 Number of ways to place 8 nonattacking bishops on an n x n toroidal board.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

Formula

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

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Formula