A204633 Least k such that k!*n! contains every digit at least once.

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

Offset

0,1

Comments

It is extremely probable that a(n) = 0 for all n >= 42.

Links

Table of n, a(n) for n=0..80.

Mathematica

Table[k=0; While[!Length[Union[IntegerDigits[k!*n!]]]==10, k++]; k, {n, 0, 60}]

Crossrefs

Cf. A000142, A204598.

Sequence in context: A374669 A255221 A072135 * A010862 A291570 A141460

Adjacent sequences: A204630 A204631 A204632 * A204634 A204635 A204636

Keyword

nonn,base

Author

Michel Lagneau, Jan 17 2012

Status

approved