login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A274503 a(n) = 301*binomial(n-1,8)+52*binomial(n-1,7)+binomial(n-1,6). 1
0, 0, 1, 59, 745, 4665, 19995, 67287, 191103, 478335, 1085370, 2276560, 4476758, 8340982, 14844570, 25397490, 41986770, 67351314, 105193671, 160433625, 239508775, 350727575, 504680605, 714716145, 997486425, 1373571225, 1868185800, 2511980406, 3341939004 (list; graph; refs; listen; history; text; internal format)
OFFSET
5,4
LINKS
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
Sequence in context: A219064 A263127 A308649 * A142363 A215433 A093259
KEYWORD
nonn,easy
AUTHOR
Vincenzo Librandi, Jun 25 2016
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 08:29 EDT 2024. Contains 371905 sequences. (Running on oeis4.)