OFFSET
0,2
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 0..200
Index entries for linear recurrences with constant coefficients, signature (11,-41,61,-30).
FORMULA
a(n) = stirling2(n+4,4) + stirling2(n+4,5). - Zerinvary Lajos, Oct 04 2007
a(0)=1, a(1)=11, a(2)=80, a(3)=490; for n>3, a(n) = 11*a(n-1) -41*a(n-2) +61*a(n-3) -30*a(n-4). - Vincenzo Librandi, Jul 05 2013
a(n) = 8*a(n-1) -15*a(n-2) +2^n -1. - Vincenzo Librandi, Jul 05 2013
a(n) = (5^(n+3) - 6*3^(n+3) + 8*2^(n+3) - 3)/24. [Yahia Kahloune, Jul 07 2013]
MAPLE
with(combinat): seq(stirling2(n+4, 4) +stirling2(n+4, 5), n=0..23); # Zerinvary Lajos, Oct 04 2007
MATHEMATICA
CoefficientList[Series[1 / ((1 - x) (1 - 2 x) (1 - 3 x) (1 -5 x)), {x, 0, 20}], x] (* Vincenzo Librandi, Jul 05 2013 *)
LinearRecurrence[{11, -41, 61, -30}, {1, 11, 80, 490}, 30] (* Harvey P. Dale, Oct 11 2024 *)
PROG
(Magma) m:=25; R<x>:=PowerSeriesRing(Integers(), m); Coefficients(R!(1/((1-x)*(1-2*x)*(1-3*x)*(1-5*x)))); /* or */ I:=[1, 11, 80, 490]; [n le 4 select I[n] else 11*Self(n-1)-41*Self(n-2)+61*Self(n-3)-30*Self(n-4): n in [1..25]]; // Vincenzo Librandi, Jul 05 2013
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
STATUS
approved