Recursive summation of summations

Question

So basically what i'm trying to find is:

-Start with $\sum_{i=1}^j 1$, which obviously is $j$
-Do the summation of the answer, which is: $\sum_{j=1}^k j$, which is $k*(k+1)/2$
-Next step is the summation of all of this: $\sum_{k=1}^l k*(k+1)/2$, what is equal to $l*(l+1)*(l+6)/12$

So, my question is: is there a formula or an easy way to know the result of this after n steps?