OFFSET
0,1
COMMENTS
LINKS
Colin Barker, Table of n, a(n) for n = 0..1000
Tanya Khovanova, Recursive Sequences
Index entries for linear recurrences with constant coefficients, signature (8,-1).
FORMULA
a(n)= (2*T(n+1, 4)+T(n, 4))/3, with T(n, x) Chebyshev's polynomials of the first kind, A053120. T(n, 4)= A001091(n).
G.f.: (3-2*x)/(1-8*x+x^2).
From Colin Barker, Oct 12 2015: (Start)
a(n) = (((4-sqrt(15))^n * (-10+3*sqrt(15)) + (4+sqrt(15))^n * (10+3*sqrt(15)))) / (2*sqrt(15)).
a(n) = 8*a(n-1) - a(n-2).
(End)
EXAMPLE
22 = a(1) = sqrt((5*A077243(1)^2 + 7)/3) = sqrt((5*17^2 + 7)/3) = sqrt(484) = 22.
MATHEMATICA
LinearRecurrence[{8, -1}, {3, 22}, 25] (* Vincenzo Librandi, Oct 12 2015 *)
PROG
(PARI) Vec((3-2*x)/(1-8*x+x^2) + O(x^40)) \\ Colin Barker, Oct 12 2015
(Magma) I:=[3, 22]; [n le 2 select I[n] else 8*Self(n-1)-Self(n-2): n in [1..30]]; // Vincenzo Librandi, Oct 12 2015
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Wolfdieter Lang, Nov 08 2002
STATUS
approved
