Let $N(h)$ be the number of solutions of the following linear diophantine equation:
\begin{equation}
x\_1 + 2x\_2 + 3x\_3 + \dots + (h-1)x\_{h-1} = 6h-6;
\end{equation}
where $h\geq 2$ and solution means a vector $(z\_1,\dots,z\_{h-1})$ of non-negative integers satisfying the equation.


Does there exist a formula for $N(h)$ or at least an explicit expression for the behavior of $N(h)$ for $h\mapsto +\infty$?



Solutions of a linear diophantine equation
As Max Alekseyev observed, $N(h)$ is the number of partitions of $6h-6$ into at most $h-1$ parts. A complicated asymptotic formula exists for this quantity, as a special case of a result of Szekeres (1953). See [this paper by Canfield](https://www.combinatorics.org/ojs/index.php/eljc/article/view/v4i2r6/pdf) for more detail.


