This is how far I could go..
example:
S = {1,2,3}
Unique possible subset pairs such that the intersection is {}
P = {} Q = {}
P = {} Q = {1}
P = {} Q = {2}
P = {} Q = {3}
P = {} Q = {1,2}
P = {} Q = {1,3}
P = {} Q = {2,3}
P = {} Q = {1,2,3}
P = {1} Q = {2}
P = {1} Q = {3}
P = {1} Q = {2,3}
P = {2} Q = {1}
P = {2} Q = {3}
P = {2} Q = {1,3}
P = {3} Q = {1}
P = {3} Q = {2}
P = {3} Q = {1,2}
Total = 17
Subset X of $S$ with $0$ elements doesn't intersect with any subsets of $S$.
So, total pairs = ${n \choose 0} \times 2^n$
Subset $X$ of $S$ with $1$ element doesn't intersect with any subsets of $S-X$.
So, total pairs = ${n \choose 1} \times \left (2^{n-1} - 1 \right) $
$-1$ because the subset $\{\}$ of $S-X$ has already been counted.
Subset $X$ of $S$ with $2$ element doesn't intersect with any subsets of $S-X$.
So, total pairs = ${n \choose 2} \times \left (2^{n-2} - 1 \right) $
$\vdots$
while $|X| <= \frac{n}{2} $
So, total pairs are: $$\left \{ \sum_{r=0}^{\frac{n}{2}} {{n \choose r} \times 2^{n-r}} \right \} - \left \{ \sum_{r=1}^{\frac{n}{2}} {n \choose r} \right \}$$
which works. But how do I simplify it?
Also, what would be a better approach for this problem?