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 A243536 #18 Nov 16 2022 13:31:47 %S A243536 4,9,15,23,25,29,37,39,43,44,47,53,59,67,73,79,83,89,93,95,97,99,103, %T A243536 107,109,111,119,122,125,127,137,139,143,149,155,157,163,167,173,179, %U A243536 187,193,197,202,223,227,229,233,241,242,251,271,277,281,303,317,337 %N A243536 Numbers n such that list of divisors of n contains 3 distinct digits (in base 10). %C A243536 Numbers n such that A037278(n), A176558(n) and A243360(n) contain 3 distinct digits. %H A243536 David A. Corneth, <a href="/A243536/b243536.txt">Table of n, a(n) for n = 1..10000</a> %e A243536 44 is in sequence because list of divisors of 44: (1, 2, 4, 11, 22, 44) contains 3 distinct digits (1, 2, 4). %o A243536 (Excel) [Row n = 1 …10000; Column A: A(n) = A095048(n); Column B: B(n) = IF(A(n)=3;A(n)); Arrangement of column B] %Y A243536 Cf. A095048, A037278, A176558, A243360. %Y A243536 Sequences of numbers n such that 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 A243536 Cf. A243543 (the smallest number m whose list of divisors contains n distinct digits). %K A243536 nonn,base %O A243536 1,1 %A A243536 _Jaroslav Krizek_, Jun 13 2014