Limits 2s, 512 MB

The road from Oyler’s home to his school has nnnsteps, where his home is at step 111 and his school is at step nnn. Everyday, Oyler starts his journey from step 111 and goes to step nnn. To move from one step to another step, Oyler makes jumps of length that are powers of two. So, from step iii Oyler can only go to step jjj if j−ij-ij−i is a nonnegative power of 222 (j>ij>ij>i). For example, if he wants to go from step 111 to step 101010, the sequence of steps Oyler crosses can be 1,5,6,8,101, 5, 6, 8, 101,5,6,8,10.

This is a companion discussion topic for the original entry at https://toph.co/p/oyler-s-geometric-jumps