OFFSET
1,4
COMMENTS
A amazon (superqueen) moves like a queen and a knight.
REFERENCES
Christian Poisson, Echecs et mathematiques, Rex Multiplex 29/1990, p.829
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 1..1000
Vaclav Kotesovec, Number of ways of placing non-attacking queens and kings on boards of various sizes
Index entries for linear recurrences with constant coefficients, signature (5,-10,10,-5,1).
FORMULA
Explicit formula (Christian Poisson, 1990): a(n) = (n - 1)(n - 2)(n - 3)(3n + 8)/6.
G.f.: 4*x^4*(5-2*x)/(1-x)^5. - Colin Barker, Jan 09 2013
E.g.f.: 8 + (1/6)*(-48 +48*x -24*x^2 +8*x^3 +3*x^4)*exp(x). - G. C. Greubel, Apr 28 2022
MATHEMATICA
CoefficientList[Series[4x^3(5-2x)/(1-x)^5, {x, 0, 40}], x] (* Vincenzo Librandi, May 27 2013 *)
LinearRecurrence[{5, -10, 10, -5, 1}, {0, 0, 0, 20, 92}, 40] (* or *) Table[(n-1)(n-2)(n-3)(3n+8)/6, {n, 40}] (* Harvey P. Dale, May 16 2021 *)
PROG
(Magma) [(n-1)*(n-2)*(n-3)*(3*n+8)/6: n in [1..50]]; // Vincenzo Librandi, May 27 2013
(SageMath) [binomial(n-1, 3)*(3*n+8) for n in (1..50)] # G. C. Greubel, Apr 28 2022
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Vaclav Kotesovec, Jan 29 2010
STATUS
approved