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”).
%I #6 Mar 30 2012 18:36:00
%S 34,34,30,37,39,30,38,29,26,34,26,16,23,27,24,27,11,17,29,21,26,19,19,
%T 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,
%U 0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0
%N Least k such that k!!*n!! contains every digit at least once.
%C It is extremely probable that a(n) = 0 for all n >= 58.
%e a(2) = 30 because 2!!*30!! = 2* 42849873690624000 = 85699747381248000 contains every digit at least once.
%t Table[k=0; While[!Length[Union[IntegerDigits[k!!*n!]]]==10, k++]; k, {n,0,60}]
%Y Cf. A006882, A204632, A204633.
%K nonn,base
%O 0,1
%A _Michel Lagneau_, Jan 19 2012