login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A038770 Numbers divisible by at least one of their digits. 9

%I

%S 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,

%T 30,31,32,33,35,36,39,40,41,42,44,45,48,50,51,52,55,60,61,62,63,64,65,

%U 66,70,71,72,75,77,80,81,82,84,85,88,90,91,92,93,95,96,99,100,101,102

%N Numbers divisible by at least one of their digits.

%C A038769(a(n)) > 0; complement of A038772.

%H Reinhard Zumkeller, <a href="/A038770/b038770.txt">Table of n, a(n) for n = 1..10000</a>

%F a(n) ~ n. - _Charles R Greathouse IV_, Jul 22 2011

%e 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.

%t Select[Range[110],MemberQ[Divisible[#,Cases[IntegerDigits[#],Except[0]]], True]&] (* _Harvey P. Dale_, Jun 20 2011 *)

%o (Haskell)

%o a038770 n = a038770_list !! (n-1)

%o a038770_list = filter f [1..] where

%o f u = g u where

%o g v = v > 0 && (((d == 0 || r > 0) && g v') || r == 0)

%o where (v',d) = divMod v 10; r = mod u d

%o -- _Reinhard Zumkeller_, Jul 30 2015, Jun 19 2011

%o (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

%Y Cf. A034709, A034837, A038769, A038772.

%K base,easy,nonn,nice

%O 1,2

%A _Henry Bottomley_, May 04 2000

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 August 20 03:33 EDT 2019. Contains 326139 sequences. (Running on oeis4.)