Give a recursive definition of some sequence of numbers.
Choose one different from that of any posted thus far.
Make a recursive method that given n, computes the nth term of that sequence.
Also provide an equivalent iterative implementation.
How do the two implementations compare?