a(n) = (Fibonacci(2n+1) + Fibonacci(2n+2)*phi)/kappa(phi/Fibonacci(4n+2)) where kappa(x) is the sum of successive remainders by computing the Euclidean algorithm for (1,x).

A088914

a(n) = (Fibonacci(2n+1) + Fibonacci(2n+2)*phi)/kappa(phi/Fibonacci(4n+2)) where kappa(x) is the sum of successive remainders by computing the Euclidean algorithm for (1,x).

Terms

    a(0) =1a(1) =32a(2) =605a(3) =10933a(4) =196384a(5) =3524489a(6) =63245753a(7) =1134902560a(8) =20365009477a(9) =365435291981

External references