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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A187565 Numbers divisible by at least eight of their digits, different and >1. 4
 1234759680, 1234857960, 1234895760, 1234958760, 1235487960, 1235679480, 1235976840, 1236795840, 1237569480, 1237589640, 1237594680, 1237695480, 1237894560, 1238549760, 1238574960, 1238597640, 1238975640, 1239547680, 1239567840, 1239756840, 1239784560, 1239847560, 1239857640, 1243579680, 1243589760, 1243879560, 1243957680, 1245378960, 1245973680, 1245983760 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS First 11460 terms are pandigital numbers (A050278). Asymptotic density 1/2520 = 0.000396.... - Charles R Greathouse IV, Mar 11 2011 11460 terms up to 10^10, 299275 terms up to 10^11, 6224794 terms up to 10^12. - Charles R Greathouse IV, Mar 11 2011 LINKS David A. Corneth, Table of n, a(n) for n = 1..11460 (terms <= 10^10) MATHEMATICA numdig = 8; Select[Range[1245983760], Length[(u = Union[Select[IntegerDigits[#], #1 > 1 &]])] >= numdig && Plus @@ (Boole@Divisible[#, u]) >= numdig &] (* Amiram Eldar, Aug 30 2020 *) PROG (PARI) s(n) = my(res=Set(digits(n))); select(x->x>1, res) is(n) = my(d=s(n)); if(#d < 8, return(0)); sum(i=1, #d, n%d[i]==0) >= 8 \\ David A. Corneth, Aug 30 2020 CROSSREFS Cf. A050278, A187398, A187516, A187238, A187533, A187534. Subsequence of A187551 (numbers divisible by at least seven ...). Sequence in context: A225139 A176942 A154769 * A204606 A104966 A100004 Adjacent sequences: A187562 A187563 A187564 * A187566 A187567 A187568 KEYWORD nonn,base AUTHOR Zak Seidov, Mar 11 2011 STATUS approved

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.

Last modified September 22 05:50 EDT 2023. Contains 365519 sequences. (Running on oeis4.)