I found a function $f$ to basically say, given any two integers $i\geq 0$ and $j\geq 0$, then $f(i,j)=x$ where $x>0$, will tell you that if you divide $x$ by $2$, $i$ times, then you will get an odd number $\leq x$ (like the first odd number in the sequence of dividing by 2). And every integer $x>0$ can be represented by some $i\geq0$ and $j\geq0$. I have also proved this to be true.
Does there exist something like this that someone discovered already or am I the first?
Edit:
f(3,4)=72
f(0,5)=11
f(17,6)=1703936
f(6,2)=320