Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A113735
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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). +0
2
1, 14, 17, 154, 1196, 26979, 66079, 279174, 1698619, 9397685 (list; graph; listen)
OFFSET

1,2

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: A054296 A105189 A102816 this_sequence A063828 A060504 A052026

Adjacent sequences: A113732 A113733 A113734 this_sequence A113736 A113737 A113738

KEYWORD

base,nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 18 20:14 EST 2008. Contains 147244 sequences.


AT&T Labs Research