OFFSET
1,1
LINKS
Harvey P. Dale, Table of n, a(n) for n = 1..1000
Index entries for linear recurrences with constant coefficients, signature (1, 1).
FORMULA
a(n) = a(n-1) + a(n-2), a(0)=29, a(1)=31.
From G. C. Greubel, Nov 17 2018: (Start)
a(n) = 27*Fibonacci(n) + 2*Fibonacci(n+1).
G.f.: x*(29+2*x)/(1-x-x^2). (End)
MATHEMATICA
LinearRecurrence[{1, 1}, {29, 31}, 40] (* Harvey P. Dale, Dec 05 2014 *)
Table[27*Fibonacci[n] +2*Fibonacci[n+1], {n, 1, 40}] (* G. C. Greubel, Nov 17 2018 *)
PROG
(PARI) vector(40, n, 27*fibonacci(n) + 2*fibonacci(n+1)) \\ G. C. Greubel, Nov 17 2018
(Magma) [27*Fibonacci(n) + 2*Fibonacci(n+1): n in [1..40]]; // G. C. Greubel, Nov 17 2018
(Sage) [27*fibonacci(n)+2*fibonacci(n+1) for n in (1..10)] # G. C. Greubel, Nov 17 2018
(GAP) List([1..40], n -> 27*Fibonacci(n)+2*Fibonacci(n+1)); # G. C. Greubel, Nov 17 2018
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Kyle D. Balliet, Mar 04 2009
STATUS
approved