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

34, 34, 30, 37, 39, 30, 38, 29, 26, 34, 26, 16, 23, 27, 24, 27, 11, 17, 29, 21, 26, 19, 19, 12, 14, 11, 8, 13, 13, 7, 2, 17, 8, 5, 0, 0, 9, 0, 2, 3, 8, 0, 4, 2, 2, 2, 5, 0, 0, 0, 2, 0, 3, 0, 0, 0, 2, 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 >= 58.

Links

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

Example

a(2) = 30 because 2!!*30!! = 2* 42849873690624000 =  85699747381248000 contains every digit at least once.

Mathematica

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

Crossrefs

Cf. A006882, A204632, A204633.

Sequence in context: A023476 A361759 A104685 * A291512 A165855 A318148

Adjacent sequences: A204770 A204771 A204772 * A204774 A204775 A204776

Keyword

nonn,base

Author

Michel Lagneau, Jan 19 2012

Status

approved