OFFSET
1,1
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 1..1000
Index entries for linear recurrences with constant coefficients, signature (1,1).
FORMULA
From Andrew Howroyd, Aug 28 2018: (Start)
a(n) = a(n-1) + a(n-2) for n > 2.
a(n) = 12*Fibonacci(n) - 5*Fibonacci(n-1).
G.f.: x*(12 - 5*x)/(1 - x - x^2).
(End)
MATHEMATICA
LinearRecurrence[{1, 1}, {12, 7}, 60]
PROG
(Magma) I:=[12, 7]; [n le 2 select I[n] else Self(n-1)+Self(n-2): n in [1..40]]; \\ Vincenzo Librandi, Feb 17 2012
(PARI) Vec((12 - 5*x)/(1 - x - x^2) + O(x^30)) \\ Andrew Howroyd, Aug 28 2018
(Python)
alst, terms = [12, 7], 37
[alst.append(alst[n-1] + alst[n-2]) for n in range(2, terms)]
print(alst) # Michael S. Branicky, Dec 07 2021
CROSSREFS
KEYWORD
nonn
AUTHOR
Vladimir Joseph Stephan Orlovsky, Feb 07 2012
STATUS
approved