|
Search: id:A073907
|
|
|
| A073907 |
|
Smallest number m such that m and the product of digits of m are both divisible by n, or 0 if no such number exists. |
|
+0
6
|
|
| 1, 2, 3, 4, 5, 7, 6, 7, 8, 9, 11, 12, 33, 24, 15, 36, 77, 24, 36, 0, 0, 168, 0, 378, 135, 48, 0, 36, 0, 0, 273, 0, 0, 168, 525, 0, 999, 476, 0, 0, 0, 288, 0, 0, 175, 1296, 0, 0, 0, 0, 0, 378, 0, 0, 495, 0, 0, 384, 3577, 0, 0, 0, 0, 1296, 0, 728, 0, 0, 0, 0, 0, 0, 1197, 448, 0, 0, 0, 0, 0, 0, 0, 1368, 0, 0
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Here 0 is regarded as not divisible by any number.
a[n]=0 if 10 divides n or n contains a prime divisor >9. - Sascha Kurz (sascha.kurz(AT)uni-bayreuth.de), Aug 23 2002
|
|
MAPLE
|
f := 1:for i from 2 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 and j>10 then a[i] := j:break:fi:od:fi:od:a[1] := 11:seq(a[k], k=1..400);
|
|
CROSSREFS
|
Cf. A073806.
Sequence in context: A071180 A031225 A085729 this_sequence A131424 A072797 A131169
Adjacent sequences: A073904 A073905 A073906 this_sequence A073908 A073909 A073910
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Aug 18 2002
|
|
EXTENSIONS
|
More terms from Sascha Kurz (sascha.kurz(AT)uni-bayreuth.de), Aug 23 2002
|
|
|
Search completed in 0.002 seconds
|
