OFFSET
1,1
COMMENTS
LINKS
Robert Israel, Table of n, a(n) for n = 1..44
MAPLE
N:= 10^50: # for terms <= N
S:= {}: p:= 1:
do
p:= nextprime(p);
v:= combinat:-fibonacci(p);
for k from 2 do
w:= v;
v:= combinat:-fibonacci(p^k);
r:= v/w;
if r > N then break fi;
S:= S union {r};
od;
if k = 2 then break fi;
od:
sort(convert(S, list)); # Robert Israel, Apr 09 2024
MATHEMATICA
t = Sort@ Flatten[ Table[ {Prime[n]^(e + 1), Prime[n]^e}, {n, 8}, {e, 10}], 1]; u = Select[t, First@# < 350 &]; Sort[ Fibonacci[ #[[1]]]/Fibonacci[ #[[2]]] & /@ u] (* Robert G. Wilson v, Oct 21 2010 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Vladimir Shevelev, Oct 18 2010
EXTENSIONS
a(11) onwards from Robert G. Wilson v, Oct 21 2010
STATUS
approved