Please help me in solving the recursion $F(n)=K_0\frac{F(n-1)}{n-1}+K_1\frac{F(n-2)}{n-2}$, preferably using power series for the values of $F(n)$ in terms of $n$. Here $K_1$ and $K_2$ are constants. We are given $F(0)=0,F(1)=3,F(2)=3/2$. Any methods of solution is welcome, even partial answers. We can discuss further. Thanks for taking time to read my question.
Asked
Active
Viewed 65 times
1
Chris Godsil
- 14,053
Nirvana
- 1,767
-
$F(0)=0$ and $F(1)=3$. Edited – Nirvana Jul 30 '14 at 01:25
-
With the exception of the scalar boundary conditions, this question is a duplicate of your previous one under the identification $F(n)=n f(n)$. – Semiclassical Jul 30 '14 at 02:34
-
yes there is similarity. I decided to post a simpler version,as the matrix case may make others confused – Nirvana Jul 30 '14 at 02:53
-
And aslo there I said matrices are skew symmetric etc.. I have plans to extent it. So I avoided that here for a general one..Please dont get confused.. – Nirvana Jul 30 '14 at 03:04