a(n) = (Lucas(2n) + Lucas(2n+1)*phi)/kappa(phi/Fibonacci(4n)) where kappa(x) is the sum of successive remainders in computing the Euclidean algorithm for (1,x).
A088913
a(n) = (Lucas(2n) + Lucas(2n+1)*phi)/kappa(phi/Fibonacci(4n)) where kappa(x) is the sum of successive remainders in computing the Euclidean algorithm for (1,x).
Terms
- a(0) =15a(1) =315a(2) =5760a(3) =103635a(4) =1860375a(5) =33384960a(6) =599073735a(7) =10749954915a(8) =192900147840a(9) =346145279a(10) =2875a(15) =644002
External references
- oeis: A088913