Where would I start if I wanted to develop an algorithm that maps consecutive integers to a long list of unique sets of integers. For example:

```
0 = {0, 0, 0}
1 = {0, 0, 1}
2 = {0, 0, 2}
3 = {0, 0, 3}
4 = {0, 0, 4}
5 = {0, 0, 5}
6 = {0, 0, 6}
7 = {0, 0, 7}
8 = {0, 0, 8}
9 = {0, 0, 9}
...
29436 = {19, 43, 11}
29437 = {19, 43, 12}
29438 = {19, 43, 13}
29439 = {19, 43, 14}
29440 = {19, 43, 15}
29441 = {19, 43, 16}
29442 = {19, 43, 17}
29443 = {19, 44, 0}
29444 = {19, 44, 1}
29445 = {19, 44, 2}
29446 = {19, 44, 3}
...
64362 = {78, 5, 0}
64363 = {78, 5, 1}
64364 = {78, 5, 2}
64365 = {78, 5, 3}
64366 = {78, 5, 4}
64367 = {78, 5, 5}
64368 = {78, 5, 6}
64369 = {78, 5, 7}
```

If an integer (number to the left of the = character) is entered, the algorithm should return the set of numbers assigned to the integer. The amount of numbers should be considered completely random. The list of number sets is quite long, but the exact number of number sets is known. Is that possible? Is machine learning required for this? Is there already an algorithm that can explain these relationships?