login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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
1, 14, 17, 154, 1196, 26979, 66079, 279174, 1698619, 9397685, 302768895, 594963655, 2249805789, 6794867989, 9785759929, 75077778589, 67471872963495, 34976979277935695, 275776822479793635, 459267544887917766, 34678475798796583278525 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..21.

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}]

CROSSREFS

Cf. A113581. Superset of A097227.

Sequence in context: A236685 A165719 A154146 * A063828 A060504 A052026

Adjacent sequences:  A113732 A113733 A113734 * A113736 A113737 A113738

KEYWORD

base,more,nonn

AUTHOR

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

EXTENSIONS

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

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

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 29 04:57 EST 2020. Contains 331335 sequences. (Running on oeis4.)