Calculate a Recursion

Calculator for recursions with two up to five start values. For one start value, see iteration. Here, a recursion is a repeated calculation with several previously computed values. As recursion variables in the formula, v for r(n-1), w for r(n-2), x for r(n-3), y for r(n-4) and z for r(n-5) are used. Only these variables v, w, x, y and z may occur in the recursion term, if the according number of start values is set. The basic arithmetic operations + - * / are allowed, as well as the power function pow(), like pow(2#z) for 2z. Further allowed functions are sin(), cos(), tan(), asin(), acos(), atan(), log() for the natural logarithm and fac() for the factorial. Also, the constants e and pi can be used.

Number of start values:

r(0)= r(1)= r(2)= r(3)= r(4)=

r =

Number of recursions:

Round to decimal places.

Example: r = v + w with two start values r(0)=1 and r(1)=1 is the Fibonacci sequence. There, a new value is calculated from the sum of the two previous values.