User blog comment:QuasarBooster/Arithmetisation of worms!/@comment-35470197-20190920031952

Good! I have not come up with this encoding method to choose the base (n+2) of a positional notation by using the input n. (I tend to fix the base independent of the input.) The strategy to repete the process without changing the initial value n is also good. It makes the expansion look clearler than 2-adic encoding or the prime factorisation, especially when n <= 8.