OFFSET
1,1
COMMENTS
Every term m is the sum of two 7-smooth numbers. Proof: Since (m-p) | m*p, we have m*p = (m - p)*k for some k > 0. Suppose m is not the sum of two 7-smooth numbers. Then m - p is not 7-smooth and so there exists a prime q > 7 such that q | (m - p). Since q doesn't divide p and q | (m - p) but (m - p) | m*p, we have q | m. But since q | m and q | (m - p) we have q | (m - (m - p)) = p, a contradiction. Q.e.d. - David A. Corneth, Jun 15 2020
LINKS
David A. Corneth, Table of n, a(n) for n = 1..152 (terms <= 10^22; first 82 terms from Giovanni Resta)
EXAMPLE
24 is a term as p = 2*4 = 8 and 24*8 = 192 is divisible by 24 - 8 = 16.
3648 is a term as p = 3*6*4*8 = 576 and 3648*576 = 2101248 is divisible by 3648-576 = 3072.
1372896 is a term as p = 1*3*7*2*8*9*6 = 18144 and 1372896*18144 = 24909825024 is divisible by 1372896 - 18144 = 1354752.
MATHEMATICA
npdQ[n_]:=Module[{p=Times@@IntegerDigits[n]}, n>p>0&&Divisible[n*p, n-p]]; Select[Range[6*10^7], npdQ] (* Harvey P. Dale, Jun 14 2020 *)
PROG
(PARI) isok(m) = my(p=vecprod(digits(m))); p && (m-p) && !((m*p) % (m-p)); \\ Michel Marcus, May 12 2020
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Scott R. Shannon, May 11 2020
STATUS
approved