This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A204633 Least k such that k!*n! contains every digit at least once. 1
 23, 23, 17, 25, 18, 17, 23, 21, 18, 17, 17, 19, 15, 17, 16, 12, 14, 2, 4, 11, 18, 7, 4, 0, 9, 3, 3, 0, 6, 2, 2, 0, 4, 0, 0, 0, 0, 0, 3, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 COMMENTS It is extremely probable that a(n) = 0 for all n >= 42. LINKS MATHEMATICA Table[k=0; While[!Length[Union[IntegerDigits[k!*n!]]]==10, k++]; k, {n, 0, 60}] CROSSREFS Cf. A000142, A204598. Sequence in context: A255228 A255221 A072135 * A010862 A291570 A141460 Adjacent sequences:  A204630 A204631 A204632 * A204634 A204635 A204636 KEYWORD nonn,base AUTHOR Michel Lagneau, Jan 17 2012 STATUS approved

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

Last modified July 19 12:49 EDT 2019. Contains 325159 sequences. (Running on oeis4.)