cp's OEIS Frontend

A329793 Smallest positive multiple of n that contains only the digits 1,2,3,4,5, or -1 if no such multiple exists.

%I A329793 #28 Apr 17 2020 10:41:16
%S A329793 -1,1,2,3,4,5,12,14,24,45,-1,11,12,13,14,15,32,34,54,114,-1,21,22,23,
%T A329793 24,25,52,54,112,145,-1,31,32,33,34,35,144,111,114,234,-1,41,42,43,44,
%U A329793 45,322,141,144,245,-1,51,52,53,54,55,112,114,232,354,-1,122,124,252,512,325,132,134,544,345,-1
%N A329793 Smallest positive multiple of n that contains only the digits 1,2,3,4,5, or -1 if no such multiple exists.
%C A329793 a(n) > 0 iff n is not a multiple of 10.
%D A329793 G. Galperin and Y. J. Ionin (Proposers), and M. Reid (Solver), Problem 12034, Amer. Math. Monthly, 126:10, 950-951, Dec. 2019.
%H A329793 Rémy Sigrist, <a href="/A329793/b329793.txt">Table of n, a(n) for n = 0..25000</a>
%H A329793 Rémy Sigrist, <a href="/A329793/a329793.gp.txt">PARI program for A329793</a>
%o A329793 (PARI) \\ See Links section.
%o A329793 (Python)
%o A329793 def A329793(n):
%o A329793     if n % 10:
%o A329793         m, s = n, set('12345')
%o A329793         while not set(str(m)) <= s:
%o A329793             m += n
%o A329793         return m
%o A329793     else:
%o A329793         return -1 # _Chai Wah Wu_, Dec 04 2019
%Y A329793 Cf. A084545, A329792.
%K A329793 sign,base
%O A329793 0,3
%A A329793 _N. J. A. Sloane_, Dec 03 2019