This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A187565 #20 Aug 30 2020 11:21:46 %S A187565 1234759680,1234857960,1234895760,1234958760,1235487960,1235679480, %T A187565 1235976840,1236795840,1237569480,1237589640,1237594680,1237695480, %U A187565 1237894560,1238549760,1238574960,1238597640,1238975640,1239547680,1239567840,1239756840,1239784560,1239847560,1239857640,1243579680,1243589760,1243879560,1243957680,1245378960,1245973680,1245983760 %N A187565 Numbers divisible by at least eight of their digits, different and >1. %C A187565 First 11460 terms are pandigital numbers (A050278). %C A187565 Asymptotic density 1/2520 = 0.000396.... - _Charles R Greathouse IV_, Mar 11 2011 %C A187565 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 %H A187565 David A. Corneth, <a href="/A187565/b187565.txt">Table of n, a(n) for n = 1..11460</a> (terms <= 10^10) %t A187565 numdig = 8; Select[Range[1245983760], Length[(u = Union[Select[IntegerDigits[#], #1 > 1 &]])] >= numdig && Plus @@ (Boole@Divisible[#, u]) >= numdig &] (* _Amiram Eldar_, Aug 30 2020 *) %o A187565 (PARI) s(n) = my(res=Set(digits(n)));select(x->x>1,res) %o A187565 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 %Y A187565 Cf. A050278, A187398, A187516, A187238, A187533, A187534. %Y A187565 Subsequence of A187551 (numbers divisible by at least seven ...). %K A187565 nonn,base %O A187565 1,1 %A A187565 _Zak Seidov_, Mar 11 2011