RosettaCodeData/Task/Minimum-multiple-of-m-where.../00-TASK.txt

22 lines
371 B
Plaintext

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|OEIS:A131382 - Minimal number m such that Sum_digits(n*m)=n]]