**Is there any algorithm there can convert any (non-infinity) sequence into one number (and back again with one solution)?**

Of course can it be turned into a N-base number (N=max(sequence)+1) but it require the highest number in the sequence which have multiple solutions.

**Thank you.**

*Sorry for my bad english*