I use the code

```
fv = RecurrenceTable({a(i) ==
1/(i (i + 1)) (1/Sqrt(w) a(i - 1) + (2 i - 1 - ep(i)) a(i - 2)),
a(2) == 1/6 (1/(2*w) - e(i)), a(1) == 1/(2 Sqrt(w))}, a, {i, 3, 10});
```

to evaluate the three step recursion ratio where

```
e(i_):=e(i)=2i+1
```

after that i need to get the roots of fv then use

```
sol2 = N(Solve(fv((1)) == 0, w))
```

My main problem is that e must be calculated using max i, that is, the code must calculate the value of e first, then I must use i to calculate the recursion ratio,

For example, for i = 3, e becomes 7, then one must calculate a (3) which includes e (3) and (2) and (1), where a (2) must be calculated using e (3) again note 2),

Maybe some kind of loop is needed.

I really don't know how to deal with this problem. Any ideas?