clipped from: forumserver.twoplustwo.com   
This is a well known problem which states that there are C(n+r -1, r-1) distinct number of nonnegative integer valued vectors (x1,x2,...,xr) satisfying x1 + x2 + ... + xr = n with "disregard to order". The formula where order matters (your example) is n!*C(n+r-1,r-1).