login
This site is supported by donations to The OEIS 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 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

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

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.

Sequence in context: A102816 A165719 A154146 * A063828 A060504 A052026

Adjacent sequences:  A113732 A113733 A113734 * A113736 A113737 A113738

KEYWORD

base,nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com) and Robert G. Wilson v, Nov 08 2005

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified May 23 21:58 EDT 2013. Contains 225612 sequences.