|
| |
|
|
A007602
|
|
Numbers that are divisible by the product of their digits.
(Formerly M0482)
|
|
19
| |
|
|
1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 15, 24, 36, 111, 112, 115, 128, 132, 135, 144, 175, 212, 216, 224, 312, 315, 384, 432, 612, 624, 672, 735, 816, 1111, 1112, 1113, 1115, 1116, 1131, 1176, 1184, 1197, 1212, 1296, 1311, 1332, 1344, 1416, 1575, 1715, 2112, 2144
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| These are called Zuckerman numbers to base 10. [From Howard Berman (howard_berman(AT)hotmail.com), Nov 09 2008]
This sequence is a subsequence of A180484; the first member of A180484 not a member of A007602 is 1114. [From D. S. McNeil (mcneil(AT)hku.hk), Sep 09 2010]
Complement of A188643; A188642(a(n)) = 1; A038186 is a subsequence; A168046(a(n)) = 1: subsequence of A052382. [Reinhard Zumkeller, Apr 07 2011]
|
|
|
REFERENCES
| N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
|
LINKS
| Reinhard Zumkeller, Table of n, a(n) for n = 1..1000
|
|
|
MATHEMATICA
| zuckerQ[n_] := Module[{d = IntegerDigits[n], prod}, prod = Times @@ d; prod > 0 && Mod[n, prod] == 0]; Select[Range[5000], zuckerQ] (* from Alonso Delarte (alonso.delarte(AT)gmail.com), Aug 04 2004 *)
|
|
|
PROG
| (Haskell)
import Data.List (elemIndices)
a007602 n = a007602_list !! (n-1)
a007602_list = map succ $ elemIndices 1 $ map a188642 [1..]
-- Reinhard Zumkeller, Apr 07 2011
(MAGMA) [ n: n in [1..2144] | not IsZero(&*Intseq(n)) and IsZero(n mod &*Intseq(n)) ]; // Bruno Berselli, May 28 2011
|
|
|
CROSSREFS
| Cf. A002796, A034709, A034838.
Cf. A001103.
Sequence in context: A063527 A064700 A180484 * A167620 A169935 A193498
Adjacent sequences: A007599 A007600 A007601 * A007603 A007604 A007605
|
|
|
KEYWORD
| nonn,base,easy
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com), Mira Bernstein, Robert G. Wilson v (rgwv(AT)rgwv.com)
|
| |
|
|
