In a Faa Di Bruno Formula there is an equation:


$m\_1$+2\*$m\_2$+3\*$m\_3$+...n\*$m\_n$=n


Is there any general solution for this equation. 


For example for 
$m\_1$+$m\_2$+$m\_3$+...+$m\_n$=n, there is a simple algorithm calculating this.
Thanks,
Gevorg.



Specific Diophantine Equation Appearing in Faa Di Bruno Formula
I presume you want to solve this equation $\sum\_{k=1}^{n}km\_k=n$ for integer $m\_k$ that sum to $s$. There is no general solution, valid for any $1\leq s\leq n$, but the problem can be reduced to a calculation of integer partitions, see [Faa di Bruno's formula, lattices, and partitions](http://www.researchgate.net/publication/223111970) (2005).


