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 #4 Jul 08 2015 11:51:02
%S 40320,1307674368000,15511210043330985984000000,
%T 371993326789901217467999448150835200000000,620448401733239439360000,
%U 608281864034267560872252163321295376887552831379210240000000000
%N Smallest factorial containing exactly n 3's.
%e a(2)=1307674368000 so 1307674368000 is the smallest factorial containing exactly two 3's.
%t With[{fctrls=Range[100]!},Table[SelectFirst[fctrls,DigitCount[#,10,3] == n&],{n,6}]] (* The program uses the SelectFirst function from Mathematica version 10 *) (* _Harvey P. Dale_, Jul 08 2015 *)
%K base,nonn
%O 1,1
%A _Shyam Sunder Gupta_, Jul 30 2002