|
| |
|
|
A068184
|
|
Smallest number whose product of digits equals n!.
|
|
1
| |
|
|
1, 1, 2, 6, 38, 358, 2589, 25789, 257889, 2578879, 45578899
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,3
|
|
|
FORMULA
| a(n)=Min{x; f[x]=n!}, where f[x_] := Apply[Times, IntegerDigits[x]].
|
|
|
EXAMPLE
| The sequence is finite because n! for n>10 has 2-digit prime-factors. For n=4 the solutions having digit products equal 24 excluding those with digit 1 are: {38,46,64,83,226,234,243,262,324,342,423,432,622,2223,2232,2322,3222} of which the smallest is 38. For n>1, numbers with a digit 1 are too big.
|
|
|
CROSSREFS
| Cf. A000142, A001222, A002473, A067734, A068183-A068187, A068189-A068191.
Sequence in context: A078673 A052841 A197972 * A067106 A032111 A013703
Adjacent sequences: A068181 A068182 A068183 * A068185 A068186 A068187
|
|
|
KEYWORD
| base,fini,nonn,full
|
|
|
AUTHOR
| Labos E. (labos(AT)ana.sote.hu), Feb 18 2002
|
|
|
EXTENSIONS
| Edited By Henry Bottomley (se16(AT)btinternet.com), Feb 26 2002.
|
| |
|
|
