Efficient encoding of integers with constant digit sum How can a large set of integers all with a known constant digit sum be encoded?

Example of integers in base 10, with digit sum 5:

14, 41, 104, 113, 122, 131, 140, 203 ....


The most important factor is space, but computing time is not completely unimportant.
Just omit the last digit.

(Extra text to get over the 30-chaacter minimum.)