Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I have the following recursive equation $$l_{n}=b_{n-1}+\sum_{k=0}^n l_k a_k b_{n-k},\ n\geq 1$$ where $b_n=1/n!,\ a_n=S_n(-1)$ where $S_n(x)=\sum_{k=0}^n \frac{x^k}{k!}\ \forall x\in \mathbb{R}$ and $l_0=0$. How to solve this?

I proceeded a little bit to solve it and here is what I did \begin{equation*} \begin{split} f(z)=&\sum_{n=0}^\infty l_n a_n z^n \\ =& \sum_{n=1}^\infty \left(b_{n-1}a_n z^n+\sum_{k=0}^n l_k a_k a_n z^n \right)\\ =& \phi(z,1)+\sum_{m=1}^\infty l_m a_m \phi(z,m) \end{split} \end{equation*}
Where $$\phi(z,m)=\sum_{n=m}^\infty b_{n-m}a_n z^n $$ Which I have shown to respect the identity $$ \phi(z,m) = z^m \left(e^{z-1}-\sum_{n=m+1}^\infty J_n(-2\sqrt{z})z^{-n/2}\right)$$ Where $J_n(x)$ is the $n$ th order Bessel function. But after that, I don't know how to proceed. Any idea?

share|cite|improve this question
I don't know how to solve it from just looking at it. I would try both: 1) Using the recurrence to compute a generating function for $\ell_n$. or 2) Apply Z-transform ( – Mlazhinka Shung Gronzalez LeWy Jun 26 '13 at 14:31
Notice that the sum on the right is a discrete convolution. That is how the coefficients of the product of two series look like. So, with generating series you will get a product of function, hopefully. With the Z-transform you will also get a multiplication. The two methods are kind of equivalent. – Mlazhinka Shung Gronzalez LeWy Jun 26 '13 at 14:33
I just noticed that probably there is a little problem with the subindexes on the right, inside the sum. Isn't it? I said it was a convolution thinking it was $\ell_k a_k b_{n-k}$. – Mlazhinka Shung Gronzalez LeWy Jun 26 '13 at 14:33
@Franklin, I used the Z-transform technique, but as you correctly noticed, the problem is with the $l_k a_k$ term. I think since $a_k$ has this particular structure, we can use that somehow to simplify the expression, but I'm still unable to do that. – Samrat Mukhopadhyay Jun 26 '13 at 14:38
But if the 'recurrence' is just like it is written then you can simply solve for $l_n$ in the equation. Let me write it in an answer to have more space. – Mlazhinka Shung Gronzalez LeWy Jun 26 '13 at 14:42

Let us aim to find first $a_nl_n$ and then to get $l_n$ we just divide by $a_n$, which is given explicitly.

Let $f(z):=\sum_{k=0}^{\infty}l_ka_kz^k$.

Multiply the recurrence by $a_nz^n$ and add from $n=0$ to $\infty$

We get


We can solve for $f$ here to get


Now, it would be useful to sum the numerator, if possible.


Uhm ... I don't see if it has a closed form. Maybe it doesn't. If it doesn't then the formula for $f$ above is the best I can give you.

share|cite|improve this answer
Are you trying to find the generating function? – Mhenni Benghorbal Jun 26 '13 at 15:02
Yes, but I am still writing the answer. Thinking on the computer directly. – Mlazhinka Shung Gronzalez LeWy Jun 26 '13 at 15:03
Ok. Now I wrote all I could think for the moment. – Mlazhinka Shung Gronzalez LeWy Jun 26 '13 at 15:24
@Franklin.vp you know I tried to find out the generating function for $l_n$ and I saw that you can get a closed form expression this if you can solve the following more general question: If $L(z)=\sum_{k=0}^\infty l_k z^k$ and $A(z)=\sum_{k=0}^\infty a_k z^k$ be the formal power series for ${l_n}$ and ${a_n}$ resp. then what is the formal power series for ${l_n a_n}$? – Samrat Mukhopadhyay Jun 26 '13 at 16:01
Look at the 'multiplication' entry in the table of properties of the Z-transform ( It is given by a contour integral. It will turn the problem into solving an integral equation in $L$. For most sequences there is no closed form. The most useful way of presenting the solution depends on what you want to do with it afterwards. – Mlazhinka Shung Gronzalez LeWy Jun 26 '13 at 16:28

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.