We have n boolean variables
So, we will have total of 2^{n} combination of truth table values
For each of these 2^{n} values, to define a boolean function they may be 0 or 1.
So we have 2 choices each for each 2^{n} combination of truth table values
Hence the total number of boolean functions possible with n variables is $2^{2^{n}}$