OFFSET
0,2
COMMENTS
Binomial transform of A081568.
Case k = 4 of family of recurrences a(n) = (2*k+1)*a(n-1) - A028387(k-1)*a(n-2) for n >= 2, with a(0) = 1 and a(1) = k + 1.
a(n) = 5^n * a(n;1/5) = Sum_{k=0..n} binomial(n,k) * (-1)^k * F(k-1) * 5^(n-k), which implies also Deléham's formula given below and where a(n;d), n=0,1,...,d, denote the delta-Fibonacci numbers defined in comments to A000045 (see also Witula's et al. papers). - Roman Witula, Jul 12 2012
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 0..200
Edyta Hetmaniok, Bożena Piątek, and Roman Wituła, Binomials Transformation Formulae of Scaled Fibonacci Numbers, Open Mathematics, 15(1) (2017), 477-485.
Roman Witula and Damian Slota, delta-Fibonacci numbers, Appl. Anal. Discr. Math 3 (2009), 310-329, MR2555042.
Index entries for linear recurrences with constant coefficients, signature (9,-19).
FORMULA
a(n) = 9*a(n-1) - 19*a(n-2) for n >= 2, with a(0) = 1 and a(1) = 5.
a(n) = (1/2 - sqrt(5)/10)*(9/2 - sqrt(5)/2)^n + (sqrt(5)/10 + 1/2)*(sqrt(5)/2 + 9/2)^n.
G.f.: (1 - 4*x)/(1 - 9*x + 19*x^2).
a(n) = Sum_{k=0..n} A094441(n,k)*4^k. - Philippe Deléham, Dec 14 2009
E.g.f.: exp(9*x/2)*(5*cosh(sqrt(5)*x/2) + sqrt(5)*sinh(sqrt(5)*x/2))/5. - Stefano Spezia, Jun 03 2024
MAPLE
seq(coeff(series((1-4*x)/(1-9*x+19*x^2), x, n+1), x, n), n = 0 .. 30); # G. C. Greubel, Aug 12 2019
MATHEMATICA
CoefficientList[Series[(1-4x)/(1 -9x +19x^2), {x, 0, 30}], x] (* Vincenzo Librandi, Aug 09 2013 *)
PROG
(Magma) I:=[1, 5]; [n le 2 select I[n] else 9*Self(n-1)-19*Self(n-2): n in [1..30]]; // Vincenzo Librandi, Aug 09 2013
(PARI) Vec((1-4*x)/(1-9*x+19*x^2) + O(x^30)) \\ Altug Alkan, Dec 10 2015
(Sage)
def A081569_list(prec):
P.<x> = PowerSeriesRing(ZZ, prec)
return P((1-4*x)/(1-9*x+19*x^2)).list()
A081569_list(30) # G. C. Greubel, Aug 12 2019
(GAP) a:=[1, 5];; for n in [3..30] do a[n]:=9*a[n-1]-19*a[n-2]; od; a; # G. C. Greubel, Aug 12 2019
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Paul Barry, Mar 22 2003
STATUS
approved