[go: up one dir, main page]

login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A068184
Smallest number whose product of digits equals n!.
3
1, 1, 2, 6, 38, 358, 2589, 25789, 257889, 2578879, 45578899
OFFSET
0,3
COMMENTS
The sequence is finite because n! for n>10 has 2-digit prime factors.
EXAMPLE
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.
KEYWORD
base,fini,nonn,full
AUTHOR
Labos Elemer, Feb 18 2002
EXTENSIONS
Edited by Henry Bottomley, Feb 26 2002
STATUS
approved