I have a sequence created with the following recursive formula:
$a_{n+1} = 2 a_{n} + n$
I need to find a generating function for this one, so that I get the formula from which I can calculate the numbers. So according to a book "Generatingfunctionology" reccomended by one user here, I need to do the following steps:
1) Multiply the formula by $ x^{n} $, so I get:
$ x^{n}a_{n+1} = 2 x^{n}a_{n} + n x^{n} $
2) "Sum over all the values of n for which the relation is valid" - so basically I'm getting (let me omit some steps):
$ \sum_{n=0}^{ \infty } a_{n} x^{n} = \frac{1 - 2x + 2x^{2}}{(1-x)^{2}(1-2x)} $
My question is - does this pattern applies to all sequences given by a recursive formula?
And one more thing - this is the result of summing up infinitive sumber of single coefficients, or however you call this part right after the Epsilon sign. How am I supposed to get the sequence elements from this thing?
Or maybe I'm messing everything up?
[tex]
and[/tex]
with$
for in-line tex, or$$
for tex on a new line. For instance$\sqrt{x}$
gives $\sqrt{x}$ and$$\sqrt{x}$$
gives $$\sqrt{x}$$ – Clive Newstead Apr 24 at 14:06