Runtime-Analysis for single loop incremented by a factor of 3
That's right. This for loop stops when: 
$$
3^i &lt; n^3 \rightarrow i&lt;3\log(n)
$$
Which implies the complexity of this for loop is $O(\log(n))$.