No Repeated Sum

Find a set of 'n' positive integers (A1 < A2 < A3 < A4 < ... < An) such that all pairs of numbers in the set have a different sum.  That is, all Ai+Aj (i < j) are unique.  Minimize An for (n <= 10).

Extension: Could also solve, considering sums Ai+Aj, (i <= j).

Source: Based on the "100 Numbers" puzzle at

Mail to Ken