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 #14 Jun 21 2018 03:21:59
%S 2,4,6,8,0,168,378,48,36,0,0,168,0,476,0,288,0,1296,0,0,378,0,0,384,0,
%T 0,1296,728,0,0,0,448,0,0,0,1368,0,0,0,0,0,672,0,0,0,0,0,384,7742,0,0,
%U 0,0,1296,0,784,0,0,0,0,0,0,3276,2688,0,0,0,0,0,0,0,3168,0,0,0,0,0,0,0
%N Smallest number m such that m and the product of digits of m are both divisible by 2n, or 0 if no such number exists.
%C Here 0 is regarded as not divisible by any number.
%C a(n) = 0 if n is divisible by 5 or contains a prime divisor > 9. - _Sascha Kurz_, Aug 23 2002
%F a(n) = A085124(2*n). - _R. J. Mathar_, Jun 21 2018
%p f := 2:for i from 1 to 400 do b := ifactors(f*i)[2]: if b[nops(b)][1]>9 or (f*i mod 10) =0 then a[i] := 0:else j := 0:while true do j := j+f*i:c := convert(j,base,10): d := product(c[k],k=1..nops(c)): if (d mod f*i)=0 and d>0 then a[i] := j:break:fi: od:fi:od:seq(a[k],k=1..400);
%Y Cf. A073906, A085124, A073908, A073910, A073911, A073912.
%K nonn,base
%O 1,1
%A _Amarnath Murthy_, Aug 18 2002
%E More terms from _Sascha Kurz_, Aug 23 2002