Finding the recursive definition for an integer sequence

I'm not sure I fully understand how to do a recursive definition for an integer sequence containing an exponent.

I can figure out that:

which equates to (mutiples of 4) x 12...but I'm not sure how to finish this to make it a recursive definition. The question I'm trying to answer has different values, my hope is to learn how to do this in general and not the specific question I'm required to answer.

Thank you.

Re: Finding the recursive definition for an integer sequence

You could write:

Now, subtract the former from the latter to get a recursion (difference equation).

Re: Finding the recursive definition for an integer sequence

Quote:

Originally Posted by

**Kevmck**

I do not understand what you are asking.

What do you want done here?

Re: Finding the recursive definition for an integer sequence

Quote:

Originally Posted by

**MarkFL2** You could write:

Now, subtract the former from the latter to get a recursion (difference equation).

Thank you for the quick response.

I'm guessing here, but that would look something like

And the only answer I seem to see right now is wrong:

but that doesn't seem like it makes any sense...

Re: Finding the recursive definition for an integer sequence

Re: Finding the recursive definition for an integer sequence

What I am suggesting would give you:

where

Re: Finding the recursive definition for an integer sequence

I thank you for the explanation, but I must be doing something wrong. When I use that formula I seem to be getting different answers.

where

Re: Finding the recursive definition for an integer sequence

Subtracting the bottom from the top, we find:

Now, from the definition you provided, we find:

Hence, using the recursion we have found we get:

Re: Finding the recursive definition for an integer sequence

Thank you MarkFL2. I'm starting to understand this now. I appreciate your help.

Re: Finding the recursive definition for an integer sequence

Finding an explicit formula for when is defined by recursion is a meaningful problem. It allows calculating directly, without going through . The converse problem — given an explicit formula, find the recursive definition — does not make much sense, or, rather, it is trivial. If , then where , i.e., g does not use the second argument. In this particular case, the recursive definition is not even simpler than the explicit formula .

Edit 1: The converse problem would make sense if in the function g can only depend on but not n. This restricted form of recursion is sometimes called iteration. But in this case is not a function of , i.e., the sequence cannot be defined using iteration.

Edit 2: To be more precise, every sequence defined by (primitive) recursion can also be defined by iteration, but the definition requires an intermediate sequence: first one defined by iteration and then for some function h.

Re: Finding the recursive definition for an integer sequence

Quote:

Originally Posted by

**MarkFL2**

Really confused how you made these transitions. Can you help me understand?

Re: Finding the recursive definition for an integer sequence

Nevermind, I just realized that if you subtract 4^{n} from 4*4^{n} you get 3*4^{n}

Sorry its been a while