How do I go from the following recurrence relation
a(n) = (n+1)a(n-1) where a(0) = 2
to a closed form? I know I need to use an iterative approach but I am not quite sure what to look for.
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It only takes a minute to sign up.Sign up to join this community