OFFSET
0,1
LINKS
Colin Barker, Table of n, a(n) for n = 0..500
Tanya Khovanova, Recursive Sequences
Index entries for linear recurrences with constant coefficients, signature (47,-1).
FORMULA
From Philippe Deléham, Nov 18 2008: (Start)
a(n) = 47*a(n-1) - a(n-2), a(0)=6, a(1)=281.
G.f.: (6-x)/(1-47*x+x^2). (End)
a(n) = (((5+3*sqrt(5))*(2/(47+21*sqrt(5)))^n + (1/2*(47+21*sqrt(5)))^n*(1885+843*sqrt(5))))/(315+141*sqrt(5)). - Colin Barker, May 05 2016
MATHEMATICA
LinearRecurrence[{47, -1}, {6, 281}, 20] (* Harvey P. Dale, Dec 14 2014 *)
Table[(Fibonacci[8*n+7]+Fibonacci[8*n+5])/3, {n, 0, 30}] (* G. C. Greubel, Dec 02 2017 *)
PROG
(PARI) Vec((6-x)/(1-47*x+x^2) + O(x^20)) \\ Colin Barker, May 05 2016
(Magma) [(Fibonacci(8*n+7) + Fibonacci(8*n+5))/3: n in [0..30]]; // G. C. Greubel, Dec 02 2017
(PARI) for(n=0, 30, print1((fibonacci(8*n+7) + fibonacci(8*n+5))/3, ", ")) \\ G. C. Greubel, Dec 02 2017
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
EXTENSIONS
Corrected and extended by T. D. Noe, Nov 07 2006
STATUS
approved