I have got a summation relation for recurrence:
$a_0$ = 1
$a_n$ = $\displaystyle\sum_{i=0}^{n-1}(i+1)a_i$
The question is: How do I make a generating function out of this? The recurrence could be modified to $a_n$ = (n+1)$a_{n-1}$ or $a_n$ = $\frac{(n+1)!}{2}$.
Thanks a lot!
Well, the initial part of the summation is the same for $a_{n+1}$ as for $a_n$, hence you may rewrite it as follows: $$a_{n+1} = \sum_{i=0}^n(i+1)a_i = \underbrace{\sum_{i=0}^{n-1}(i+1)a_i}_\text{hey, that's $a_n$} + (n+1)\cdot a_n = (n+2)\cdot a_n$$ which is exactly what you needed.
Too bad the generating function diverges everywhere, but that's another story.