|
|
A172138
|
|
Number of ways to place 3 nonattacking zebras on an n X n board.
|
|
6
|
|
|
0, 4, 84, 452, 1772, 5596, 14888, 34640, 72712, 140716, 255036, 437968, 718980, 1136092, 1737376, 2582576, 3744848, 5312620, 7391572, 10106736, 13604716, 18056028, 23657560, 30635152, 39246296, 49782956, 62574508, 77990800
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
A zebra is a (fairy chess) leaper [2,3].
|
|
LINKS
|
|
|
FORMULA
|
a(n) = (n^6 - 27*n^4 + 120*n^3 + 74*n^2 - 1608*n + 2976)/6, n >=6.
G.f.: 4*x^2*(1 + 14*x - 13*x^2 + 58*x^3 - 29*x^4 - 9*x^5 + x^6 + 33*x^7 - 45*x^8 + 23*x^9 - 4*x^10)/(1-x)^7. - Vaclav Kotesovec, Mar 25 2010
|
|
MATHEMATICA
|
CoefficientList[Series[4x(1+14*x-13*x^2+58*x^3-29*x^4-9*x^5+x^6+ 33*x^7- 45*x^8 +23*x^9-4*x^10)/(1-x)^7, {x, 0, 40}], x] (* Vincenzo Librandi, May 27 2013 *)
LinearRecurrence[{7, -21, 35, -35, 21, -7, 1}, {0, 4, 84, 452, 1772, 5596, 14888, 34640, 72712, 140716, 255036, 437968}, 30] (* Harvey P. Dale, Mar 11 2023 *)
|
|
PROG
|
(Magma) [0, 4, 84, 452, 1772] cat [(n^6 -27*n^4 +120*n^3 +74*n^2 -1608*n +2976)/6: n in [6..50]]; // G. C. Greubel, Apr 19 2022
(SageMath) [0, 4, 84, 452, 1772]+[(n^6 -27*n^4 +120*n^3 +74*n^2 -1608*n +2976)/6 for n in (6..50)] # G. C. Greubel, Apr 19 2022
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|