|
%I #11 Mar 30 2012 18:36:00
%S 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,
%T 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,
%U 0,0,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 >= 42.
%t Table[k=0;While[!Length[Union[IntegerDigits[k!*n!]]]==10,k++];k,{n,0,60}]
%Y Cf. A000142, A204598.
%K nonn,base
%O 0,1
%A _Michel Lagneau_, Jan 17 2012
|
