My guess is that this sequence diverge to infinity since every now and then the power of $2$ number increases in the long run. I.e. for $2^x$, $x$ increases. Is it easy to show and prove this sequence diverge to infinity? I dont know where to start and how to do it step by step.
Highest power of $2$ that divides $n$: $$\{{1,2,1,4,1,2,1,8,1,2,1,4,1,2,1,16,1,2,1,4,...\}}$$
Information about the sequence can be found on A006519.
Let's call the sequence $a_n$.
It's easy to show it diverges, for the subsequence $$ a_1, a_3, a_5, \ldots, a_{2k+1}, \ldots $$ is $$ 1, 1, 1, 1, \ldots, 1, \ldots, $$ which converges to $1$, while the subsequence $$ a_2, a_6, a_{10}, \ldots, a_{2 + 4k}, \ldots $$ is $$ 2, 2, 2, \ldots, 2, \ldots $$ which converges to $2$. But in general, if a sequence converges to a limit $L$, then every subsequence also converges to $L$. In other words, if your sequence converged to some limit $L$, then that limit would have to be both $1$ and $2$, which is impossible.
Since the definition of "diverges" is "doesn't converge," your sequence diverges.
Your observation that for every natural number $k$, we have $$ a_{2^k} = 2^k $$ does in fact mean that as $n$ goes to infinity, there is no upper bound on $a_n$. If you want to say that this means it "diverges to infinity," I suppose you're welcome to do so, but most mathematicians will not recognize that phrase as meaningful.