[ QUOTE ]
F(N) = F(N-1)*(2N-1)*(2N)/2.
How can I ultimately get to: F(N) = (2N)! / 2^N?
I guess I'm asking, what is the standard procedure that can take me from the recurrence relation to the closed form solution? Is there a straightforward methodology? Or is this usually done on a case-by-case basis?
[/ QUOTE ]
I believe there are straightforward methods that work for examples as simple as this, but these are also usually done individually.
This is an example of a
hypergeometric sequence.