Generate the sequence a(n) when each element is the minimum integer multiple m such that the digit sum of n times m is equal to n.



Task
 Find the first 40 elements of the sequence.


Stretch
 Find the next 30 elements of the sequence.


See also
 OEIS:A131382 - Minimal number m such that Sum_digits(n*m)=n




            NORMAL MODE IS INTEGER
            VECTOR VALUES FMT = $2HA(,I2,4H) = ,I8*$
 
            THROUGH NUMBER, FOR N = 1, 1, N.G.70
MULT        THROUGH MULT, FOR M = 1, 1, N.E.DSUM.(M*N)
NUMBER      PRINT FORMAT FMT, N, M
 
            INTERNAL FUNCTION(X)
            ENTRY TO DSUM.
            SUM = 0
            V = X
DIGIT       WHENEVER V.E.0, FUNCTION RETURN SUM
            W = V/10
            SUM = SUM + V - W*10
            V = W
            TRANSFER TO DIGIT
            END OF FUNCTION
            END OF PROGRAM