Hello,Originally Posted by bayatly_00
The definition of your sequence (it has quite a funny name, never heard before!) is similar to the definition of the original Fibonacci sequence:
If you want to calculate the value of for instance then you must calculate before, and to calculate you have to calculate and so on and so on, until you reach the beginning of the sequence. That means you have to go back to the beginning every time you want to calculate a value. "To go back" means in Latin "recurrere", so the expression recursive describes the procedure perfectly.