The OEIS is supported by the many generous donors to the OEIS Foundation.

 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 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A068183 Largest number without decimal digits equal to 1 whose product of digits gives n!. 10
 2, 32, 3222, 53222, 5332222, 75332222, 75332222222, 7533332222222, 755333322222222 (list; graph; refs; listen; history; text; internal format)
 OFFSET 2,1 COMMENTS Maximal solutions are obtained from the concatenation of distinct prime factors that have one decimal digit. The sequence is finite because, for n>10, n! has 2-digit prime factors. LINKS Table of n, a(n) for n=2..10. FORMULA a(n)=Max{x; f[x]=n!}, where x has no digit=1 and f[x_] := Apply[Times, IntegerDigits[x]]. CROSSREFS Cf. A000142, A001222, A002473, A067734, A068183-A068187, A068189-A068191. Sequence in context: A093584 A117259 A234365 * A166077 A053853 A018241 Adjacent sequences: A068180 A068181 A068182 * A068184 A068185 A068186 KEYWORD base,fini,nonn,full AUTHOR Labos Elemer, Feb 18 2002 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 11 06:34 EST 2023. Contains 367717 sequences. (Running on oeis4.)