|
|
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).
|
|
0
|
|
|
15, 315, 5760, 103635, 1860375, 33384960, 599073735, 10749954915, 192900147840, 346145279, 2875, 62113250350815, 1114577054115840, 20000273725289535, 358890350005167435, 644002, 6026378384000, 115561578124833652035
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|