cp's OEIS Frontend

A087141 Numbers divisible by the sum of their digits, but not by all their individual digits.

%I A087141 #14 Oct 18 2021 08:39:00
%S A087141 10,18,20,21,27,30,40,42,45,50,54,60,63,70,72,80,81,84,90,100,102,108,
%T A087141 110,114,117,120,133,140,150,152,153,156,171,180,190,192,195,198,200,
%U A087141 201,204,207,209,210,220,225,228,230,234,240,243,247,252,261,266,270
%N A087141 Numbers divisible by the sum of their digits, but not by all their individual digits.
%H A087141 David A. Corneth, <a href="/A087141/b087141.txt">Table of n, a(n) for n = 1..10000</a>
%e A087141 225 is in the sequence as 225 is divisible by 2 + 2 + 5 = 9 but not by 2 while 2 is a digit of 225. - _David A. Corneth_, Jan 28 2021
%o A087141 (PARI) is(n) = { my(d = digits(n), sd = vecsum(d), s = Set(d)); if(sd != 0 && n % sd == 0, if(s[1] == 0, return(1) ); for(i = 1, #s, if(n % s[i] != 0, return(1) ) ); 0 ); 0 } \\ _David A. Corneth_, Jan 28 2021
%o A087141 (Python)
%o A087141 def ok(n):
%o A087141     d = list(map(int, str(n)))
%o A087141     if n == 0 or n%sum(d): return False
%o A087141     return 0 in d or any(n%di for di in set(d))
%o A087141 print([k for k in range(271) if ok(k)]) # _Michael S. Branicky_, Oct 18 2021
%Y A087141 Intersection of A087140 and A005349.
%Y A087141 Cf. A087142.
%K A087141 nonn,base
%O A087141 1,1
%A A087141 _Reinhard Zumkeller_, Aug 18 2003