a(1) = 1; for n > 1 take the digits of a(n-1) one after the other and remove one occurrence of this digit from the digits of m = k*n (k > 0) if possible; a(n) is the smallest multiple m of n which has the least number of remaining digits (counted with multiplicity).

A078188

a(1) = 1; for n > 1 take the digits of a(n-1) one after the other and remove one occurrence of this digit from the digits of m = k*n (k > 0) if possible; a(n) is the smallest multiple m of n which has the least number of remaining digits (counted with multiplicity).

Terms

    a(0) =1a(1) =2a(2) =3a(3) =4a(4) =5a(5) =6a(6) =7a(7) =8a(8) =9a(9) =90a(10) =99a(11) =96a(12) =26a(13) =28a(14) =285a(15) =528a(16) =85a(17) =18a(18) =19a(19) =20a(20) =21a(21) =22a(22) =23a(23) =24a(24) =25a(25) =52a(26) =27a(27) =28a(28) =29a(29) =90

External references