So I have been given a table of numbers and I have figured out the pattern but have no idea what the general formula for the sequence is. Here is the sequence:
| n | m |
|---|---|
| 2 | 8 |
| 3 | 30 |
| 4 | 128 |
| 5 | 650 |
| 6 | 3912 |
I realised that the m-value is equal to the n-value multiplied by the previous m-value and then 2*n-value is added to create the m-value, but I'm not sure how to put this into a formula. Please help it would be much appreciated, and explanations as to how to do these in the future are much appreciated.
HINT:
Although there can be infinitely many solutions, the way you can write your relation is in the form of a recurrence relation. You can think of the $m$ value that corresponds to $n$ as $f(n)$, and the previous $m$ value as $f(n-1)$.
With these, try to define $f(n)$ in terms of $f(n-1)$ and $n$ according to your pattern.