OFFSET
5,3
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 (7,-21,35,-35,21,-7,1).
FORMULA
G.f.: x^6*(1 + 24*x)/(1-x)^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).
a(n) = (n-1)*(n-2)*(n-3)*(n-4)*(n-5)*(25*n-144)/720. - Wesley Ivan Hurt, Jun 25 2016
MAPLE
A274501:=n->25*binomial(n-1, 6) + binomial(n-1, 5): seq(A274501(n), n=5..50); # Wesley Ivan Hurt, Jun 25 2016
MATHEMATICA
Table[25 Binomial[n - 1, 6] + Binomial[n - 1, 5], {n, 5, 40}]
LinearRecurrence[{7, -21, 35, -35, 21, -7, 1}, {0, 1, 31, 196, 756, 2226, 5502}, 40] (* Harvey P. Dale, Mar 09 2022 *)
PROG
(Magma) [25*Binomial(n-1, 6)+Binomial(n-1, 5): n in [5..40]];
(PARI) concat(0, Vec(x^6*(1+24*x)/(1-x)^7 + O(x^99))) \\ Altug Alkan, Jun 27 2016
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Vincenzo Librandi, Jun 25 2016
STATUS
approved