|
| |
|
|
A038770
|
|
Numbers divisible by at least one of their digits.
|
|
8
| |
|
|
1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 24, 25, 26, 28, 30, 31, 32, 33, 35, 36, 39, 40, 41, 42, 44, 45, 48, 50, 51, 52, 55, 60, 61, 62, 63, 64, 65, 66, 70, 71, 72, 75, 77, 80, 81, 82, 84, 85, 88, 90, 91, 92, 93, 95, 96, 99, 100, 101, 102
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| A038769(a(n)) > 0; complement of A038772.
|
|
|
LINKS
| Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
|
|
|
FORMULA
| a(n) ~ n. [Charles R Greathouse IV, Jul 22 2011]
|
|
|
EXAMPLE
| 35 is included because 5 is a divisor of 35, but 37 is not included because neither 3 nor 7 is a divisor of 37
|
|
|
MATHEMATICA
| Select[Range[110], MemberQ[Divisible[#, Cases[IntegerDigits[#], Except[0]]], True]&] (* From Harvey P. Dale, June 20 2011 *)
|
|
|
PROG
| (Haskell)
import Data.Char (digitToInt)
a038770 n = a038770_list !! (n-1)
a038770_list = filter p [1..] where
p n = any (== 0) $ map ((mod n) . digitToInt) $ filter (> '0') $ show n
-- Reinhard Zumkeller, Jun 19 2011
(PARI) is(n)=my(v=vecsort(eval(Vec(Str(n))), , 8)); for(i=if(v[1], 1, 2), #v, if(n%v[i]==0, return(1))); 0 \\ Charles R Greathouse IV, Jul 22 2011
|
|
|
CROSSREFS
| Cf. A034709, A034837, A038769, A038772.
Sequence in context: A004830 A081330 A080682 * A193176 A032517 A062996
Adjacent sequences: A038767 A038768 A038769 * A038771 A038772 A038773
|
|
|
KEYWORD
| base,easy,nonn,nice
|
|
|
AUTHOR
| Henry Bottomley (se16(AT)btinternet.com), May 04 2000
|
| |
|
|
