Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #15 Dec 04 2024 23:04:25
%S 1,2,3,4,5,6,7,8,9,10,11,14,19,20,29,30,31,33,36,39,40,49,50,52,55,59,
%T 60,63,64,69,70,71,77,79,80,89,90,99,100,102,108,110,113,118,119,120,
%U 132,140,150,166,168,180,190,195,198,200,201,204
%N Numbers k such that k is congruent to the product of its digits modulo the sum of its digits.
%H Harry J. Smith, <a href="/A065448/b065448.txt">Table of n, a(n) for n = 1..1000</a>
%e 14 is in the sequence because 14 == 4 (mod 5).
%t Select[Range[2000], Mod[ # - Apply[Times, IntegerDigits[[ # ]]], Apply[Plus, IntegerDigits[[ # ]]]] == 0 &]
%o (PARI) isok(k) = {my(d=digits(k)); (k-vecprod(d)) % vecsum(d) == 0} \\ _Harry J. Smith_, Oct 19 2009
%Y Cf. A007953, A007954.
%K base,nonn
%O 1,2
%A _Santi Spadaro_, Nov 18 2001