Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #8 Nov 16 2022 13:31:28
%S 36,56,60,68,70,78,80,84,96,112,116,135,136,138,150,172,184,189,190,
%T 192,196,207,212,225,230,238,243,245,256,260,261,267,268,272,285,290,
%U 292,344,345,350,358,368,384,387,388,396,400,402,418,441,444,455,459,462
%N Numbers n such that the list of divisors of n contains 7 distinct digits (in base 10).
%C Numbers n such that A037278(n), A176558(n) and A243360(n) contain 7 distinct digits.
%H David A. Corneth, <a href="/A243540/b243540.txt">Table of n, a(n) for n = 1..10000</a>
%e 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 (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 Cf. A095048, A037278, A176558, A243360.
%Y 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 Cf. A243543 (the smallest number m whose list of divisors contains n distinct digits).
%K nonn,base
%O 1,1
%A _Jaroslav Krizek_, Jun 19 2014