Is there any way to calculate this efficiently?

$\displaystyle

\sum_{i=min_N}^{max_N}\left\{

\sum_{j=min_{N-1}}^{i-1}\left\{

...\left\{

\sum_{q=min_2}^{p-1} 1

...

\right\}

\right\}

\right\}

$

It's only $\displaystyle N-1$ nested summations where

the top limit of the next summation, is the iterator variable of the previous.

Thanx in advance