A069716 Smallest number such that the LCM of the digits equals n, or 0 if no such number exists.
1, 2, 3, 4, 5, 6, 7, 8, 9, 25, 0, 34, 0, 27, 35, 0, 0, 29, 0, 45, 37, 0, 0, 38, 0, 0, 0, 47, 0, 56, 0, 0, 0, 0, 57, 49, 0, 0, 0, 58, 0, 67, 0, 0, 59, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 78, 0, 0, 0, 345, 0, 0, 79, 0, 0, 0, 0, 0, 0, 257, 0, 89, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 347, 0, 0, 0, 0, 0, 259, 0, 0
Offset: 1
Examples
a(20) = 45 because lcm(4, 5) = 20. If one solution exists, then an infinite number of solutions exist. For n = 20, e.g., 455, 445555555, 545544 etc. are also solutions.
Links
- Sean A. Irvine, Table of n, a(n) for n = 1..2520 (includes all nonzero terms)
Comments