Recursive sequences in CAS on prime.

[Arno K]

Here is a solution:

Code:

#cas
mf(n):=
BEGIN
IF n==1 THEN
RETURN(3/2);
ELSE
IF n==2 THEN
RETURN(5/3);
END;
RETURN(2003-6002/mf(n-1)+4000/(mf(n-1)*mf(n-2)));
END;


END;
#end

which seems to work in your desired way. It provides exact values at least until n=10, now I am trying 25 and this runs now the fifth minute on the emulator which is due to the 3 recursive calls in the code, so I cancelled it.
Arno