cp's OEIS Frontend

A263314 Numbers m whose decimal representation includes at least one digit that divides every digit of m.

%I A263314 #65 Jan 11 2016 03:23:04
%S A263314 1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,24,26,28,30,
%T A263314 31,33,36,39,40,41,42,44,48,50,51,55,60,61,62,63,66,70,71,77,80,81,82,
%U A263314 84,88,90,91,93,99,100,101,102,103,104,105,106,107,108,109,110,111,112
%N A263314 Numbers m whose decimal representation includes at least one digit that divides every digit of m.
%C A263314 Every number that has a digit '1' (cf. A011531) is in this sequence. Sequence A034838 (every digit divides n) is not a subsequence (e.g., 324 is not in the present sequence). - _M. F. Hasler_, Jan 10 2016
%H A263314 Chai Wah Wu, <a href="/A263314/b263314.txt">Table of n, a(n) for n = 1..10000</a>
%o A263314 (Python)
%o A263314 A263314_list = []
%o A263314 for i in range(10**4):
%o A263314     s = str(i)
%o A263314     for d in s:
%o A263314         j = int(d)
%o A263314         if j :
%o A263314             for e in s:
%o A263314                 if int(e) % j:
%o A263314                     break
%o A263314             else:
%o A263314                 A263314_list.append(i)
%o A263314                 break
%o A263314 # _Chai Wah Wu_, Oct 21 2015
%o A263314 (PARI) is(n)={n && (n=select(t->t,Set(digits(n))))%n[1]==0} \\ The divisor is necessarily the smallest nonzero digit. A vector having no nonzero component is considered equal to 0. - _M. F. Hasler_, Jan 10 2016
%K A263314 nonn,base
%O A263314 1,2
%A A263314 _Giovanni Teofilatto_, Oct 14 2015