OFFSET
0,1
COMMENTS
a(n) mod 9 = 7.
A two-way infinite sequence with a(-n) = a(n-1).
LINKS
G. C. Greubel, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (4,-4,1).
FORMULA
G.f.: 2*(8-15*x+8*x^2)/((1-x)*(1-3*x+x^2)). - Jaume Oliver Lafont, Aug 30 2009
a(n) = 2*A153873(n) = 18*Fibonacci(2*n+1)-2.
a(n) = (2^(-n)*(-5*2^(1+n)-9*(3-sqrt(5))^n*(-5+sqrt(5))+9*(3+sqrt(5))^n*(5+sqrt(5))))/5. - Colin Barker, Nov 02 2016
MATHEMATICA
LinearRecurrence[{4, -4, 1}, {16, 34, 88} , 100] (* G. C. Greubel, Jun 18 2016 *)
PROG
(Magma) [18*Fibonacci(2*n+1)-2: n in [0..30]]; // Vincenzo Librandi, Jun 19 2016
(PARI) Vec(2*(8-15*x+8*x^2)/((1-x)*(1-3*x+x^2)) + O(x^30)) \\ Colin Barker, Nov 02 2016
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Paul Curtz, Jan 02 2009
EXTENSIONS
Edited by Charles R Greathouse IV, Oct 05 2009
STATUS
approved