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).

Original entry on oeis.org

18, 24, 30, 32, 40, 42, 48, 52, 63, 64, 81, 86, 87, 92, 98, 105, 106, 128, 130, 134, 146, 147, 148, 158, 176, 186, 188, 198, 200, 201, 203, 222, 235, 246, 247, 248, 249, 255, 259, 264, 278, 286, 310, 314, 322, 327, 328, 329, 330, 332, 334, 338, 346, 351, 357
Offset: 1

Views

Author

Jaroslav Krizek, Jun 19 2014

Keywords

Comments

Numbers n such that A037278(n), A176558(n) and A243360(n) contain 6 distinct digits.

Examples

			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).
		

Crossrefs

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.
Cf. A243543 (the smallest number m whose list of divisors contains n distinct digits).

Programs

  • 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]
  • Mathematica
    Select[Range[400],Length[Union[Flatten[IntegerDigits/@Divisors[#]]]]==6&] (* Harvey P. Dale, Apr 13 2025 *)