OFFSET
0,1
COMMENTS
FORMULA
a(n) = Fibonacci(5^(n+1))/Fibonacci(5^n).
Recurrence equation: a(n+1) = 5/2*(a(n)^4 - a(n)^2)*sqrt(4*a(n) + 5) + a(n)^5 + 15/2*a(n)^4 - 25/2*a(n)^2 + 5 with initial condition a(0) = 5.
a(n) = Lucas(4*5^n) - Lucas(2*5^n) + 1. - Ehren Metcalfe, Jul 29 2017
CROSSREFS
KEYWORD
nonn,easy,bref
AUTHOR
Peter Bala, Nov 09 2012
STATUS
approved