 Gödel beta-function sequence coding

The Gödel beta function codes finite sequences by remainders:Choosing $c$ sufficiently large and divisible by the relevant small integers makes the moduli pairwise coprime, so the Chinese remainder theorem codes any prescribed finite sequence.