I have the following recurrence relation $$T(n) = T(\log_2 n) + 13n.$$
I believe in order to solve the equation I need to determine the height of the tree.
$$T(n) \to T(\log_2 n) \to T(\log_2(\log_2 n)) \to \ldots \to T(0)$$
I feel it's very efficient, but how do I compute/prove it? I would like to know the closed form of this recurrence relation. Any suggestions?