login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A187516 Numbers divisible by at least two of their digits, different and >1. 10

%I #18 Aug 30 2020 04:24:08

%S 24,36,48,124,126,128,132,135,162,168,175,184,204,208,216,224,234,240,

%T 244,246,248,250,264,273,276,280,284,288,306,312,315,324,328,336,342,

%U 345,348,357,360,366,369,372,375,378,384,396,408,412,420,424,426,428,432,435,448,452,456,462,468,472,476,480,488,492,495,520,524,528,540,564,584,612,624,630,636,639,642,648

%N Numbers divisible by at least two of their digits, different and >1.

%C There are 225 such integers < 2000, 1679 less than 10^4, 21389 less than 10^5, and 251613 less than 10^6.

%C Asymptotic density 17/35 = 0.485.... - _Charles R Greathouse IV_, Mar 11 2011

%H Amiram Eldar, <a href="/A187516/b187516.txt">Table of n, a(n) for n = 1..10000</a>

%t s={};Do[un=Select[Union[IntegerDigits[n]],#>1&];cnt=0;Do[d=un[[k]];If[Mod[n,d]==0,cnt++;If[cnt>1,AppendTo[s,n];Goto[ne]]],{k,Length@un}];Label[ne],{n,10000}];s

%t dtdQ[n_]:=Total[Boole[Divisible[n,Union[Select[IntegerDigits[n], #>1&]]]]]>1; Select[Range[700],dtdQ]

%o (PARI) is(n)=my(d=Set(digits(n))); sum(i=1,#d, d[i]>1 && n%d[i]==0)>1 \\ _Charles R Greathouse IV_, Feb 11 2017

%Y Cf. A185186, A187238, A187398, A187533, A187534, A187551, A187565, A187584.

%K nonn,base

%O 1,1

%A _Zak Seidov_, Mar 10 2011

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 16 00:06 EDT 2024. Contains 374343 sequences. (Running on oeis4.)