MuPAD Pro Computing Essentials - Examples 

Example 5.6 To produce a recursive procedure

The sequence {xn} is given by the recursive formula

Here I show how this formula can be implemented in MuPAD as an recursive procedure.  Do not use this procedure for larger n. It will produce quite large numbers. Use it rather as an inspiration to develop your own examples. For instance implementing this way  procedure to produce Fibonacci numbers can be quite nice job. 

• recExamp := proc (n: Type::Integer)
  begin
     if n<=0 then
        return("Input n>0")
     elif n=1 then
        return(1)
     elif n=2 then
        return(3)
     else
        return(recExamp(n-1)^3 * recExamp(n-2)^2)
     end
  end:    

• recExamp(6)

2088595827392656793085408064780643

444068898148936888424953199350267