OFFSET
0,1
LINKS
Colin Barker, Table of n, a(n) for n = 0..1000
S. B. Ekhad, N. J. A. Sloane, D. Zeilberger, Automated proofs (or disproofs) of linear recurrences satisfied by Pisot Sequences, arXiv:1609.05570 [math.NT] (2016)
Index entries for linear recurrences with constant coefficients, signature (0, 1, 1).
FORMULA
a(n) = a(n-2) + a(n-3) for n>=3. (Proved using the PtoRv program of Ekhad-Sloane-Zeilberger.) - N. J. A. Sloane, Sep 09 2016
G.f.: (7+9*x+5*x^2) / (1-x^2-x^3). - Colin Barker, Jun 05 2016
MATHEMATICA
LinearRecurrence[{0, 1, 1}, {7, 9, 12}, 50] (* Jean-François Alcover, Aug 31 2018 *)
CoefficientList[Series[(7 + 9 x + 5 x^2)/(1 - x^2 - x^3), {x, 0, 50}], x] (* Stefano Spezia, Aug 31 2018 *)
CROSSREFS
A subsequence of A000931.
See A008776 for definitions of Pisot sequences.
KEYWORD
nonn
AUTHOR
STATUS
approved