OFFSET
0,3
LINKS
G. C. Greubel, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (0,2,1).
FORMULA
a(n) = Fibonacci(n+2) - Lucas(n) + 2*(-1)^n.
a(n) = (-1)^n*A112469(n). - Philippe Deléham, Apr 19 2013
a(n) = Fibonacci(n-2) + 2*(-1)^n. - Philippe Deléham, Apr 19 2013
MATHEMATICA
LinearRecurrence[{0, 2, 1}, {1, -1, 2}, 50] (* Harvey P. Dale, Jan 14 2015 *)
Table[Fibonacci[n-2] +2*(-1)^n, {n, 0, 50}] (* G. C. Greubel, Aug 04 2019 *)
PROG
(PARI) Vec((1-x)/(1-2*x^2-x^3)+O(x^50)) \\ Charles R Greathouse IV, Sep 26 2012
(Magma) [Fibonacci(n-2) +2*(-1)^n: n in [0..50]]; // G. C. Greubel, Aug 04 2019
(Sage) [fibonacci(n-2) + 2*(-1)^n for n in (0..50)] # G. C. Greubel, Aug 04 2019
(GAP) List([0..50], n-> Fibonacci(n-2) + 2*(-1)^n); # G. C. Greubel, Aug 04 2019
CROSSREFS
KEYWORD
sign,easy
AUTHOR
N. J. A. Sloane, Nov 17 2002
STATUS
approved