|
| |
|
|
A069716
|
|
Smallest number such that the LCM of the digits equals n, or 0 if no such number exists.
|
|
1
| |
|
|
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
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
FORMULA
| a(n)=Min{x; Apply[LCM, IntegerDigits[x]]=n}.
|
|
|
EXAMPLE
| n=20: a(20)=45 because LCM[4,5]=20. If one solution exists, then an infinite number of solutions exists. E.g. for n=20 455,445555555,545544 etc. are also solutions.
|
|
|
MATHEMATICA
| f[x_] := Apply[LCM, IntegerDigits[x]] t = Table[0, {256} ]; Do[ s = f[n]; If[s < 257 && t[[s]] == 0, t[[s]] = n], {n, 1, 10000} ]; t
|
|
|
CROSSREFS
| Cf. A068189, A069716.
Sequence in context: A061862 A007532 A068189 * A095289 A174141 A095706
Adjacent sequences: A069713 A069714 A069715 * A069717 A069718 A069719
|
|
|
KEYWORD
| easy,nonn,base
|
|
|
AUTHOR
| Labos E. (labos(AT)ana.sote.hu), Apr 02 2002
|
| |
|
|
