OFFSET
0,3
COMMENTS
Scaled Chebyshev U-polynomials evaluated at 3/2.
LINKS
Colin Barker, Table of n, a(n) for n = 0..1000
A. F. Horadam, Special properties of the sequence W_n(a,b; p,q), Fib. Quart., 5.5 (1967), 424-434. Case n->n+1, a=0,b=1; p=9, q=-9.
Wolfdieter Lang, On polynomials related to powers of the generating function of Catalan's numbers, Fib. Quart. 38 (2000) 408-419. Eqs.(38) and (45),lhs, m=9.
Index entries for linear recurrences with constant coefficients, signature (9,-9).
FORMULA
a(n) = A001906(n)*3^(n-1).
a(n) = S(n, 3)*3^n with S(n, x) := U(n, x/2), Chebyshev's polynomials of the 2nd kind, A049310.
G.f.: x/(1-9*x+9*x^2).
a(n) = (1/3)*Sum_{k=0..n} binomial(n, k)*Fibonacci(4*k). - Benoit Cloitre, Jun 21 2003
a(n+1) = Sum_{k=0..n} A109466(n,k)*9^k. - Philippe Deléham, Oct 28 2008
MATHEMATICA
f[n_]:= Fibonacci[2n]*3^(n-1); Table[f@n, {n, 0, 20}] (* or *)
a[0]=0; a[1]=1; a[n_]:= a[n]= 9(a[n-1] -a[n-2]); Table[a[n], {n, 0, 20}] (* or *)
CoefficientList[Series[x/(1-9x +9x^2), {x, 0, 20}], x] (* Robert G. Wilson v Sep 21 2006 *)
PROG
(PARI) a(n)=(1/3)*sum(k=0, n, binomial(n, k)*fibonacci(4*k)) \\ Benoit Cloitre
(PARI) concat(0, Vec(x/(1-9*x+9*x^2) + O(x^30))) \\ Colin Barker, Jun 14 2015
(Sage) [lucas_number1(n, 9, 9) for n in range(0, 21)] # Zerinvary Lajos, Apr 23 2009
(Magma) [3^(n-1)*Fibonacci(2*n): n in [0..30]]; // G. C. Greubel, May 02 2022
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Wolfdieter Lang, Aug 11 2000
EXTENSIONS
Edited by N. J. A. Sloane, Sep 16 2005
STATUS
approved