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 #21 Nov 16 2022 13:31:41
%S 6,8,10,14,21,26,35,49,50,51,62,65,66,82,85,88,91,110,115,117,123,133,
%T 141,142,159,165,169,183,209,213,217,221,226,231,239,244,250,253,257,
%U 262,263,269,275,283,293,295,299,307,309,319,326,333,347,349,355,359
%N Numbers n such that list of divisors of n contains 4 distinct digits (in base 10).
%C Numbers n such that A037278(n), A176558(n) and A243360(n) contain 4 distinct digits.
%H David A. Corneth, <a href="/A243537/b243537.txt">Table of n, a(n) for n = 1..10000</a> (first 1000 terms from Harvey P. Dale)
%e 49 is in sequence because divisors of 49: (1, 7, 49) contain 4 distinct digits (1, 4, 7, 9).
%t Select[Range[400],Length[Union[Flatten[IntegerDigits/@Divisors[#]]]] == 4&] (* _Harvey P. Dale_, Aug 22 2021 *)
%o (Excel) [Row n = 1 …10000; Column A: A(n) = A095048(n); Column B: B(n) = IF(A(n)=4;A(n)); Arrangement of column B]
%Y Cf. A095048, A037278, A176558, A243360.
%Y 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 Cf. A243543.
%K nonn,base
%O 1,1
%A _Jaroslav Krizek_, Jun 13 2014