login

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”).

A073909
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.
4
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, 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, 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
OFFSET
1,1
COMMENTS
Here 0 is regarded as not divisible by any number.
a(n) = 0 if n is divisible by 5 or contains a prime divisor > 9. - Sascha Kurz, Aug 23 2002
FORMULA
a(n) = A085124(2*n). - R. J. Mathar, Jun 21 2018
MAPLE
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);
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Amarnath Murthy, Aug 18 2002
EXTENSIONS
More terms from Sascha Kurz, Aug 23 2002
STATUS
approved