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 A243540 #8 Nov 16 2022 13:31:28 %S A243540 36,56,60,68,70,78,80,84,96,112,116,135,136,138,150,172,184,189,190, %T A243540 192,196,207,212,225,230,238,243,245,256,260,261,267,268,272,285,290, %U A243540 292,344,345,350,358,368,384,387,388,396,400,402,418,441,444,455,459,462 %N A243540 Numbers n such that the list of divisors of n contains 7 distinct digits (in base 10). %C A243540 Numbers n such that A037278(n), A176558(n) and A243360(n) contain 7 distinct digits. %H A243540 David A. Corneth, <a href="/A243540/b243540.txt">Table of n, a(n) for n = 1..10000</a> %e A243540 36 is in sequence because the list of divisors of 36: (1, 2, 3, 4, 6, 9, 12, 18, 36) contains 7 distinct digits (1, 2, 3, 4, 6, 8, 9). %o A243540 (Excel) [Row n = 1...10000; Column A: A(n) = A095048(n); Column B: B(n) = IF(A(n)=7;A(n)); Arrangement of column B] %Y A243540 Cf. A095048, A037278, A176558, A243360. %Y A243540 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 A243540 Cf. A243543 (the smallest number m whose list of divisors contains n distinct digits). %K A243540 nonn,base %O A243540 1,1 %A A243540 _Jaroslav Krizek_, Jun 19 2014