Wow, what a great question. Let me make an attempt too.
The pattern in set T seems to be this: a,b,a+b,2(a+b),4(a+b),...2^(n-3)*(a+b).
From the pattern we can see that if the first two elements are not chosen then we would be able to freely choose anything without getting the same sum. Reason: assume a>b without losing generalibilty, 2^a+2^b=2^a(1+2^(b-a)) and 1+2^(b-a) will never be a power of 2. In other words, the sum of any two terms that a factor of 2 will not equal to any term of the set.
When we include the first two terms with other elements in T, however, it is likely we will get a sum that is not distinctive. For example a+b+2(a+b)=(a+b)+2(a+b).
Knowing this, let's start to pick elements of set V.
Two elements: we are safe because set V only includes sum of two elements and up. Total outcomes C(n,2)
Three elements: When a and b are chosen with another element other than (a+b), we will get a sum that is equal to (a+b) with that particular element, which we have already counted in the two elements group. Therefore total outcome would be C(n,3)-C(n-3,1). Here n-3 is because we choose the third element from set T but we can't choose a,b,and (a+b).
Four elements: Similarly, total outcomes would be C(n,4)-C(n-4,1).
...
Therefore total outcome would be:
C(n,2)+C(n,3)+...+C(n,n)-C(n-3,1)-C(n-4,1)...-C(1,1)
Here n=9, total outcome would be
C(9,2)+C(9,3)+...+C(9,9)-C(6,1)-C(5,1)-...C(1,1)
=2^9-C(9,0)-C(9,1)-C(6,1)-C(5,1)-...-C(1,1)
=512-1-9-6-5-4-3-2-1
=481