Textbook Problem

If n is a positive integer, how many 5-tuples of integers from 1 through n can be formed in which the elements of the 5-tuple are written in decreasing order but are not necessarily distinct? In other words, how many 5-tuples of integers $\left(h,i,j,k,m\right)$ are there with $n\ge h\ge i\ge j\ge k\ge m\ge 1$ ?