OFFSET
5,4
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 5..1000
Q. T. Bach, R. Paudyal, J. B. Remmel, A Fibonacci analogue of Stirling numbers, arXiv preprint arXiv:1510.04310 [math.CO], 2015 (page 25).
Index entries for linear recurrences with constant coefficients, signature (9,-36,84,-126,126,-84,36,-9,1).
FORMULA
G.f.: x^7*(1 + 50*x + 250*x^2)/(1-x)^9.
a(n) = 9*a(n-1) - 36*a(n-2) + 84*a(n-3) - 126*a(n-4) + 126*a(n-5) - 84*a(n-6) + 36*a(n-7) - 9*a(n-8) + a(n-9).
a(n) = (n-1)*(n-2)*(n-3)*(n-4)*(n-5)*(n-6)*(301*n^2-4099*n+14000)/40320. - Wesley Ivan Hurt, Jun 25 2016
MAPLE
A274503:=n->301*binomial(n-1, 8)+52*binomial(n-1, 7)+binomial(n-1, 6): seq(A274503(n), n=5..50); # Wesley Ivan Hurt, Jun 25 2016
MATHEMATICA
Table[301*Binomial[n-1, 8]+52*Binomial[n-1, 7]+Binomial[n-1, 6], {n, 5, 40}]
PROG
(Magma) [301*Binomial(n-1, 8)+52*Binomial(n-1, 7)+Binomial(n-1, 6): n in [5..40]];
(PARI) concat([0, 0], Vec(x^7*(1 + 50*x + 250*x^2)/(1-x)^9 + O(x^100))) \\ Altug Alkan, Jun 26 2016
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Vincenzo Librandi, Jun 25 2016
STATUS
approved