I've been trying to solve this recurrence relation in my advance algorithms paper. I've found that the Master method doesn't work.
I tried using an iterative method up to an extent, and then substituted $n = 2^{2^i}$ as below
http://postimage.org/image/624p28vn5/
Please can someone suggest a way to solve it. Any other method that works would also be appreciated!