OFFSET
0,2
COMMENTS
Binomial transform of A002535.
LINKS
G. C. Greubel, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (4,6).
FORMULA
a(n) = (2+sqrt(10))^n/2 + (2-sqrt(10))^n/2.
G.f.: (1-2*x)/(1-4*x-6*x^2).
E.g.f.: exp(2*x)*cosh(sqrt(10)*x).
a(n) = Sum_{k=0..n} A201730(n,k)*9^k. - Philippe Deléham, Dec 06 2011
G.f.: G(0)/2, where G(k) = 1 + 1/(1 - x*(5*k-2)/(x*(5*k+3) - 1/G(k+1))); (continued fraction). - Sergei N. Gladkovskii, Jun 03 2013
a(n) = 2*i^n*6^((n-2)/2)*( 3*ChebyshevU(n, 2/(i*sqrt(6))) + i*sqrt(6)*ChebyshevU(n -1, 2/(i*sqrt(6))) ). - G. C. Greubel, Oct 13 2022
MATHEMATICA
LinearRecurrence[{4, 6}, {1, 2}, 40] (* G. C. Greubel, Oct 13 2022 *)
PROG
(SageMath) [lucas_number2(n, 4, -6)/2 for n in range(0, 22)] # Zerinvary Lajos, May 14 2009
(SageMath)
A084132=BinaryRecurrenceSequence(4, 6, 1, 2)
[A084132(n) for n in range(41)] # G. C. Greubel, Oct 13 2022
(Magma) [n le 2 select 2^(n-1) else 4*Self(n-1) +6*Self(n-2): n in [1..40]]; // G. C. Greubel, Oct 13 2022
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Paul Barry, May 16 2003
STATUS
approved