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 A243538 #8 Nov 16 2022 13:31:54 %S A243538 12,16,20,27,28,34,38,45,46,57,58,69,74,75,94,100,118,124,129,132,145, %T A243538 153,154,161,164,166,171,175,177,178,185,194,195,205,206,214,215,218, %U A243538 219,220,237,254,265,273,274,279,284,287,289,291,297,298,301,302,305 %N A243538 Numbers n such that the list of divisors of n contains 5 distinct digits (in base 10). %C A243538 Numbers n such that A037278(n), A176558(n) and A243360(n) contain 5 distinct digits. %H A243538 David A. Corneth, <a href="/A243538/b243538.txt">Table of n, a(n) for n = 1..10000</a> %e A243538 45 is in sequence because the list of divisors of 45: (1, 3, 5, 9, 15, 45) contains 5 distinct digits (1, 3, 4, 5, 9). %o A243538 (Excel) [Row n = 1...10000; Column A: A(n) = A095048(n); Column B: B(n) = IF(A(n)=5;A(n)); Arrangement of column B] %Y A243538 Cf. A095048, A037278, A176558, A243360. %Y A243538 Sequences of numbers n such that the list of divisors of n contains k distinct digits for 1 <= k <= 10: k = 1: A243534; k = 2: A243535; k = 3: A243536; k = 4: A243537; k = 5: A243538; k = 6: A243539; k = 7: A243540; k = 8: A243541; k = 9: A243542; k = 10: A095050. %Y A243538 Cf. A243543 (the smallest number m whose list of divisors contains n distinct digits). %K A243538 nonn,base %O A243538 1,1 %A A243538 _Jaroslav Krizek_, Jun 19 2014