OFFSET
0,2
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 0..200
Index entries for linear recurrences with constant coefficients, signature (21,-146,336).
FORMULA
If we define f(m,j,x) = Sum_{k=j..m} (binomial(m,k)*stirling2(k,j)*x^(m-k)) then a(n-2)=f(n,2,6), (n>=2). - Milan Janjic, Apr 26 2009
a(n) = 18*6^n -49*7^n +32*8^n. - R. J. Mathar, Jun 30 2013
a(0)=1, a(1)=21, a(2)=295; for n>2, a(n) = 21*a(n-1) -146*a(n-2) +336*a(n-3). - Vincenzo Librandi, Jul 04 2013
a(n) = 15*a(n-1) -56*a(n-2) +6^n. - Vincenzo Librandi, Jul 04 2013
MATHEMATICA
CoefficientList[Series[1/((1-6*x)*(1-7*x)*(1-8*x)), {x, 0, 20}], x] (* Harvey P. Dale, Feb 24 2011 *)
PROG
(Magma) m:=20; R<x>:=PowerSeriesRing(Integers(), m); Coefficients(R!(1/((1-6*x)*(1-7*x)*(1-8*x)))); /* or */ I:=[1, 21, 295]; [n le 3 select I[n] else 21*Self(n-1)-146*Self(n-2)+336*Self(n-3): n in [1..20]]; // Vincenzo Librandi, Jul 04 2013
(PARI) x='x+O('x^30); Vec(1/((1-6*x)*(1-7*x)*(1-8*x))) \\ G. C. Greubel, Feb 07 2018
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
STATUS
approved