A113735 Let prime(0) = 1 and f(n) = product prime(d), where d ranges over all the decimal digits of n. The sequence gives numbers n such that f(n) == 0 (mod n).

1, 14, 17, 154, 1196, 26979, 66079, 279174, 1698619, 9397685, 302768895, 594963655, 2249805789, 6794867989, 9785759929, 75077778589, 67471872963495, 34976979277935695, 275776822479793635, 459267544887917766, 34678475798796583278525

Offset: 1

Author

Amarnath Murthy and Robert G. Wilson v, Nov 08 2005

Keywords

• base
• more
• nonn

Crossrefs

Cf. A113581. Superset of A097227.

Programs

Mathematica

f[n_] := Times @@ (IntegerDigits[n] /. {0 -> 1, 1 -> 2, 2 -> 3, 3 -> 5, 4 -> 7, 5 -> 11, 6 -> 13, 7 -> 17, 8 -> 19, 9 -> 23}); Do[ If[ Mod[ f[n], n] == 0, Print[n]], {n, 10^8}]

Extensions

a(11)-a(16) from Giovanni Resta, Aug 09 2017

a(17)-a(21) from Chai Wah Wu, May 07 2019