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 Apr 07 2014 03:36:34
%S 0,0,1,0,1,2,0,0,1,2,1,2,2,4,0,2,2,3,1,2,2,3,1,5,5,8,4,3,3,3,7,2,6,9,
%T 8,9,4,9,6,5,4,6,7,6,11,8,7,16,11,6,8,12,8,12,8,12,4,16,11,4,15,14,15,
%U 11,15,14,8,13,20,10,8,18,14,15,14,16,14,16,12,22,17,17,15,17,17,20,14,16
%N Number of 3's in n# (n primorial) = 3's in A002110(n).
%H Vincenzo Librandi, <a href="/A079113/b079113.txt">Table of n, a(n) for n = 2..1000</a>
%t DigitCount[#, 10, 3]&/@Rest[FoldList[Times, 1, Prime[Range[100]]]] (* _Vincenzo Librandi_, Apr 07 2014 *)
%o (PARI) See program in Number of 0's in n#
%Y Cf. A002110.
%K easy,nonn
%O 2,6
%A _Cino Hilliard_, Feb 03 2003