A201246 -id:A201246 - cp's OEIS frontend

A201243 Number of ways to place 2 non-attacking ferses on an n X n board.

0, 4, 28, 102, 268, 580, 1104, 1918, 3112, 4788, 7060, 10054, 13908, 18772, 24808, 32190, 41104, 51748, 64332, 79078, 96220, 116004, 138688, 164542, 193848, 226900, 264004, 305478, 351652, 402868, 459480, 521854, 590368, 665412, 747388, 836710, 933804, 1039108

Offset: 1

Vaclav Kotesovec, Nov 28 2011

Fers is a leaper [1,1].

Vincenzo Librandi, Table of n, a(n) for n = 1..1000
Vaclav Kotesovec, Non-attacking chess pieces, 6ed, p.415
Index entries for linear recurrences with constant coefficients, signature (5,-10,10,-5,1).

Cf. A172123, A201244, A201245, A201246, A201247, A201248.

I:=[0, 4, 28, 102, 268]; [n le 5 select I[n] else 5*Self(n-1)-10*Self(n-2)+10*Self(n-3)-5*Self(n-4)+Self(n-5): n in [1..40]]; // Vincenzo Librandi, Apr 30 2013

[(n-1)*(n^3+n^2-4*n+4)/2: n in [1..40]]; // Vincenzo Librandi, Apr 30 2013

Table[(n - 1) (n^3 + n^2 - 4 n + 4) / 2, {n, 100}] (* Vincenzo Librandi, Apr 30 2013 *)
LinearRecurrence[{5,-10,10,-5,1},{0,4,28,102,268},40] (* Harvey P. Dale, Dec 31 2014 *)

a(n) = 1/2*(n-1)*(n^3 + n^2 - 4n + 4) by C. Poisson, 1990.
G.f.: 2x^2*(x+1)*(x^2-2x-2)/(x-1)^5.
a(n) = 5*a(n-1)-10*a(n-2)+10*a(n-3)-5*a(n-4)+a(n-5). - Vincenzo Librandi, Apr 30 2013

A201244 Number of ways to place 3 non-attacking ferses on an n X n board.

Original entry on oeis.org

0, 0, 38, 340, 1630, 5552, 15210, 35828, 75530, 146240, 264702, 453620, 742918, 1171120, 1786850, 2650452, 3835730, 5431808, 7545110, 10301460, 13848302, 18357040, 24025498, 31080500, 39780570, 50418752, 63325550, 78871988, 97472790, 119589680, 145734802

Offset: 1

Vaclav Kotesovec, Nov 28 2011

Fers is a leaper [1,1].

Vincenzo Librandi, Table of n, a(n) for n = 1..1000
Vaclav Kotesovec, Non-attacking chess pieces, 6ed, p.415
Index entries for linear recurrences with constant coefficients, signature (7,-21,35,-35,21,-7,1).

Cf. A172124, A201243, A201245, A201246, A201247, A201248.

I:=[0, 0, 38, 340, 1630, 5552, 15210, 35828]; [n le 8 select I[n] else 7*Self(n-1)-21*Self(n-2)+35*Self(n-3)-35*Self(n-4)+21*Self(n-5)-7*Self(n-6)+Self(n-7): n in [1..40]]; // Vincenzo Librandi, Apr 30 2013

[0] cat [(n-2)*(n^5+2*n^4-11*n^3 +2*n^2+54*n-60)/6: n in [2..35]]; // Vincenzo Librandi, Apr 30 2013

CoefficientList[Series[- 2 x^2 (x^5 + 3 x^4 - 24 x^3 + 24 x^2 + 37 x + 19) / (x-1)^7, {x, 0, 40}], x] (* Vincenzo Librandi, Apr 30 2013 *)

a(n) = (n-2)*(n^5 + 2n^4 - 11n^3 + 2n^2 + 54n - 60)/6, n>=2.
G.f.: -2x^3*(x^5 + 3x^4 - 24x^3 + 24x^2 + 37x + 19)/(x-1)^7.
a(n) = 7*a(n-1)-21*a(n-2)+35*a(n-3)-35*a(n-4)+21*a(n-5)-7*a(n-6)+a(n-7). - Vincenzo Librandi, Apr 30 2013

A201245 Number of ways to place 4 non-attacking ferses on an n X n board.

Original entry on oeis.org

0, 0, 29, 661, 6285, 35378, 143787, 468529, 1301351, 3202970, 7170593, 14872997, 28969129, 53527866, 94568255, 160741233, 264175507, 421511954, 655152581, 994751765, 1478979173, 2157585442, 3093803379, 4367119121, 6076449375, 8343762538, 11318183177

Offset: 1

Vaclav Kotesovec, Nov 28 2011

Fers is a leaper [1,1].

Vincenzo Librandi, Table of n, a(n) for n = 1..1000
V. Kotesovec, Non-attacking chess pieces, 6ed, p.415
Index entries for linear recurrences with constant coefficients, signature (9, -36, 84, -126, 126, -84, 36, -9, 1).

Cf. A172127, A201243, A201244, A201246, A201247, A201248.

CoefficientList[Series[- x^2 (2 x^8 - 55 x^7 + 230 x^6 - 254 x^5 - 225 x^4 + 173 x^3 + 1380 x^2 + 400 x + 29)/(x-1)^9, {x, 0, 40}], x] (* Vincenzo Librandi, Apr 30 2013 *)

a(n) = (n^8 - 30n^6 + 48n^5 + 299n^4 - 912n^3 - 462n^2 + 4368n - 4200)/24, n>=3.

G.f.: -x^3*(2*x^8 - 55*x^7 + 230*x^6 - 254*x^5 - 225*x^4 + 173*x^3 + 1380*x^2 + 400*x + 29)/(x-1)^9.

A201247 Number of ways to place 6 non-attacking ferses on an n X n board.

Original entry on oeis.org

0, 0, 2, 552, 29412, 527654, 5196928, 34528698, 173951172, 714042302, 2503447216, 7744201834, 21635290132, 55540293510, 132752090192, 298491879178, 636559136340, 1296099575166, 2533344878048, 4774975629082, 8712052571140, 15436347060646, 26634487077600

Offset: 1

Vaclav Kotesovec, Nov 28 2011

Fers is a leaper [1,1].

Vincenzo Librandi, Table of n, a(n) for n = 1..1000
V. Kotesovec, Non-attacking chess pieces, 6ed, p.415
Index entries for linear recurrences with constant coefficients, signature (13, -78, 286, -715, 1287, -1716, 1716, -1287, 715, -286, 78, -13, 1).

Cf. A176886, A201243, A201244, A201245, A201246, A201248.

CoefficientList[Series[- 2 x^2 (41 x^14 - 502 x^13 + 2506 x^12 - 7605 x^11 + 18870 x^10 - 41305 x^9 + 60117 x^8 - 21366 x^7 - 73987 x^6 + 52960 x^5 + 237560 x^4 + 93891 x^3 + 11196 x^2 + 263 x + 1)/(x-1)^13, {x, 0, 40}], x] (* Vincenzo Librandi, Apr 30 2013 *)

a(n) = n^12/720 - 5n^10/48 + n^9/6 + 461n^8/144 - 29n^7/3 - 2147n^6/48 + 1289n^5/6 + 65807n^4/360 - 6356n^3/3 + 9185n^2/6 + 22834n/3 - 11478, n>=5.

G.f.: -2x^3*(41x^14 - 502x^13 + 2506x^12 - 7605x^11 + 18870x^10 - 41305x^9 + 60117x^8 - 21366x^7 - 73987x^6 + 52960x^5 + 237560x^4 + 93891x^3 + 11196x^2 + 263x + 1)/(x-1)^13.

A201248 Number of ways to place 7 non-attacking ferses on an n X n board.

Original entry on oeis.org

0, 0, 0, 216, 38070, 1314600, 21191208, 207830308, 1442794332, 7775083960, 34530764200, 131660992164, 443702617356, 1350258600008, 3771242866680, 9789675562020, 23856321869260, 55015308882264, 120855465245464, 254284702668580, 514791197224860, 1006655249550696

Offset: 1

Vaclav Kotesovec, Nov 28 2011

nonn

Fers is a leaper [1,1].

V. Kotesovec, Non-attacking chess pieces
Index entries for linear recurrences with constant coefficients, signature (15, -105, 455, -1365, 3003, -5005, 6435, -6435, 5005, -3003, 1365, -455, 105, -15, 1).

Cf. A187239, A201243, A201244, A201245, A201246, A201247.

a(n) = n^14/5040 - n^12/48 + n^11/30 + 673n^10/720 - 17n^9/6 - 1019n^8/48 + 197n^7/2 + 9772n^6/45 - 3443n^5/2 + 47n^4/4 + 74259n^3/5 - 1816352n^2/105 - 49376n + 90660, n>=6.

G.f.: 2*x^4*(125*x^16 - 1785*x^15 + 11715*x^14 - 50121*x^13 + 158605*x^12 - 367485*x^11 + 570175*x^10 - 533381*x^9 + 460395*x^8 - 1262515*x^7 + 2731225*x^6 - 1795227*x^5 - 5484089*x^4 - 2685639*x^3 - 383115*x^2 - 17415*x - 108)/(x-1)^15.

A278684 Number of non-equivalent ways to place 5 non-attacking ferses on an n X n board.

Original entry on oeis.org

0, 0, 2, 99, 2102, 19987, 124676, 571418, 2122841, 6704061, 18711691, 47235845, 109938296, 238950999, 490309398, 957267228, 1790325363, 3224010105, 5615368229, 9493358359, 15627413290, 25112609019, 39484650296, 60859027054, 92114682749, 137111560949, 200972392655

Offset: 1

Heinrich Ludwig, Nov 26 2016

A fers is a leaper [1, 1].

Rotations and reflections of placements are not counted. If they are to be counted, see A201246.

			There are 2 ways to place 5 non-attacking ferses on a 3 X 3 board, rotations and reflections being ignored:
   XXX   XXX
   ...   ...
   X.X   XX.

Heinrich Ludwig, Table of n, a(n) for n = 1..1000
Wikipedia, Fairy chess piece
Index entries for linear recurrences with constant coefficients, signature (5,-4,-20,40,16,-100,44,110,-110,-44,100,-16,-40,20,4,-5,1).

Cf. A201246, A232567 (2 ferses), A278682 (3 ferses), A278683 (4 ferses), A278685 (6 ferses), A278686 (7 ferses), A278687, A278688.

[0, 0, 2] cat [(n^10 - 50*n^8 + 80*n^7 + 955*n^6 - 2828*n^5 - 7090*n^4 + 36860*n^3 - 10856*n^2 - 133712*n + 161280 + ((1-(-1)^n)/2)*(52*n^5 - 145*n^4 - 580*n^3 + 2320*n^2 - 1152*n - 15))/960 : n in [4..30]]; // Wesley Ivan Hurt, Nov 27 2016

A278684:=n->(n^10 - 50*n^8 + 80*n^7 + 955*n^6 - 2828*n^5 - 7090*n^4 + 36860*n^3 - 10856*n^2 - 133712*n + 161280 + ((1-(-1)^n)/2)*(52*n^5 - 145*n^4 - 580*n^3 + 2320*n^2 - 1152*n - 15))/960: 0, 0, 2, seq(A278684(n), n=4..30); # Wesley Ivan Hurt, Nov 27 2016

Join[{0, 0, 2}, Table[(n^10 - 50*n^8 + 80*n^7 + 955*n^6 - 2828*n^5 - 7090*n^4 + 36860*n^3 - 10856*n^2 - 133712*n + 161280 + ((1-(-1)^n)/2)*(52*n^5 - 145*n^4 - 580*n^3 + 2320*n^2 - 1152*n - 15))/960, {n, 4, 30}]] (* Wesley Ivan Hurt, Nov 27 2016 *)

concat(vector(2), Vec(x^3*(2 +89*x +1615*x^2 +9913*x^3 +35049*x^4 +66034*x^5 +78731*x^6 +45748*x^7 +9902*x^8 -5540*x^9 -1343*x^10 +1685*x^11 +409*x^12 -334*x^13 -83*x^14 +38*x^15 +6*x^16 -x^17) / ((1 -x)^11*(1 +x)^6) + O(x^40))) \\ Colin Barker, Dec 10 2016

a(n) = (n^10 - 50*n^8 + 80*n^7 + 955*n^6 - 2828*n^5 - 7090*n^4 + 36860*n^3 - 10856*n^2 - 133712*n + 161280 + ((1-(-1)^n)/2)*(52*n^5 - 145*n^4 - 580*n^3 + 2320*n^2 - 1152*n - 15))/960 for n >= 4.
a(n) = 5*a(n-1) - 4*a(n-2) - 20*a(n-3) + 40*a(n-4) + 16*a(n-5) - 100*a(n-6) + 44*a(n-7) + 110*a(n-8) - 110*a(n-9) - 44*a(n-10) + 100*a(n-11) - 16*a(n-12) - 40*a(n-13) + 20*a(n-14) + 4*a(n-15) - 5*a(n-16) + a(n-17) for n >= 21.
G.f.: x^3*(2 +89*x +1615*x^2 +9913*x^3 +35049*x^4 +66034*x^5 +78731*x^6 +45748*x^7 +9902*x^8 -5540*x^9 -1343*x^10 +1685*x^11 +409*x^12 -334*x^13 -83*x^14 +38*x^15 +6*x^16 -x^17) / ((1 -x)^11*(1 +x)^6). - Colin Barker, Dec 10 2016

cp's OEIS Frontend

A201243 Number of ways to place 2 non-attacking ferses on an n X n board.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Magma

Mathematica

Formula

A201244 Number of ways to place 3 non-attacking ferses on an n X n board.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Magma

Mathematica

Formula

A201245 Number of ways to place 4 non-attacking ferses on an n X n board.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Formula

A201247 Number of ways to place 6 non-attacking ferses on an n X n board.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Formula

A201248 Number of ways to place 7 non-attacking ferses on an n X n board.

Views

Author

Keywords

Comments

Links

Crossrefs

Formula

A278684 Number of non-equivalent ways to place 5 non-attacking ferses on an n X n board.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Formula