Recursion call inside a for loop time I'm analyzing a piece of code that has a recursive call inside a for loop such as:

def fun(n):
    for i in range(0, 256):
         if ( n &gt; 0):
             fun(n-8)


(I only included a general piece of code not the actual version)

It is my understanding that a recursive call gets assigned T(n) = T(n-8) but what happens when it is nested inside a for loop?
As there is a loop over $F(n-8)$, so we will have 256 times $F(n-8)$. Hence, time complexity would be:
$$T(n) = 256\times T(n-8) = 256\times(256\times T(n-16)) = \Theta(256^\frac{n}{8})$$.

As mentioned in comment $256 = 2^8$, we will have $T(n) = \Theta(2^n)$.