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).

1, 32, 605, 10933, 196384, 3524489, 63245753, 1134902560, 20365009477, 365435291981, 6557470308896, 117669030432337, 2111485077903025, 37889062372947488, 679891637638098029, 12200160415120530469

Offset

0,2

Links

Table of n, a(n) for n=0..15.

Crossrefs

Sequence in context: A010557 A022756 A332262 * A036903 A208828 A013699

Adjacent sequences: A088911 A088912 A088913 * A088915 A088916 A088917

Keyword

easy,nonn

Author

Thomas Baruchel, Nov 29 2003; corrected Jun 09 2004

Status

approved