OFFSET
0,3
COMMENTS
With these particular values, a(n) turns out to be Fibonacci(n) + (-2)^n.
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 0..1000
C. N. Phadte and S. P. Pethe, On second order non homogeneous recurrence relation, Annales Mathematicae et Infomaticae, 41 (2013), 205-210.
Index entries for linear recurrences with constant coefficients, signature (-1,3,2).
FORMULA
G.f.: (x+x^2*(A-t))/((1-x*t)*(1-x-x^2)).
MATHEMATICA
nn = 40; A = 1; t = -2; CoefficientList[Series[(x + x^2 (A - t))/((1 - x*t) (1 - x - x^2)), {x, 0, nn}], x] (* T. D. Noe, Sep 21 2013 *) (* or *)
LinearRecurrence[{-1, 3, 2}, {0, 1, 2}, 35] (* Georg Fischer, Jan 26 2022 *)
CROSSREFS
KEYWORD
sign,easy
AUTHOR
Chandrakant N Phadte and Yeshwant Shivrai Valaulikar, Sep 18 2013
STATUS
approved