cp's OEIS Frontend

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.

A243539 Numbers n such that the list of divisors of n contains 6 distinct digits (in base 10).

This page as a plain text file.
%I A243539 #10 Apr 13 2025 16:32:03
%S A243539 18,24,30,32,40,42,48,52,63,64,81,86,87,92,98,105,106,128,130,134,146,
%T A243539 147,148,158,176,186,188,198,200,201,203,222,235,246,247,248,249,255,
%U A243539 259,264,278,286,310,314,322,327,328,329,330,332,334,338,346,351,357
%N A243539 Numbers n such that the list of divisors of n contains 6 distinct digits (in base 10).
%C A243539 Numbers n such that A037278(n), A176558(n) and A243360(n) contain 6 distinct digits.
%H A243539 David A. Corneth, <a href="/A243539/b243539.txt">Table of n, a(n) for n = 1..10000</a>
%e A243539 48 is in sequence because the list of divisors of 48: (1, 2, 3, 4, 6, 8, 12, 16, 24, 48) contains 6 distinct digits (1, 2, 3, 4, 6, 8).
%t A243539 Select[Range[400],Length[Union[Flatten[IntegerDigits/@Divisors[#]]]]==6&] (* _Harvey P. Dale_, Apr 13 2025 *)
%o A243539 (Excel) [Row n = 1...10000; Column A: A(n) = A095048(n); Column B: B(n) = IF(A(n)=6;A(n)); Arrangement of column B]
%Y A243539 Cf. A095048, A037278, A176558, A243360.
%Y A243539 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 A243539 Cf. A243543 (the smallest number m whose list of divisors contains n distinct digits).
%K A243539 nonn,base
%O A243539 1,1
%A A243539 _Jaroslav Krizek_, Jun 19 2014