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´m stuck on a problem. Can anyone help me? The problem: Find the recurrence relation to

$$a_n=a_{n-1}+2a_{n-2}+\cdots+(n-1)a_1+na_0\;(\text{for }n\ge 1),\\a_0=1$$

I guess I have to compare $a_n-a_{n-1}$ with $a_{n-1}-a_{n-2}$?

share|cite|improve this question
Have you tried doing that? – Avi Steiner Sep 17 '13 at 16:14
up vote 1 down vote accepted

Hint: In your own hint, substitute $a_n$, $a_{n-1}$, $a_{n-2}$ with the formula that you are given.

What is the recurrence relation that you get?

$a_{n} = 3 a_{n-1} - a_{n-2}$.

share|cite|improve this answer

And in the worst case if it's a bad day OEIS is allways there... ;)

share|cite|improve this answer

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.