%I #8 Apr 07 2014 03:53:04
%S 0,0,0,0,0,0,0,0,1,0,0,2,0,1,5,2,0,4,4,2,1,2,2,3,1,4,6,2,5,3,3,1,4,0,
%T 8,5,5,4,1,10,6,5,10,5,10,8,6,5,8,8,7,6,6,13,7,9,9,11,9,9,13,13,11,14,
%U 16,8,9,11,13,13,11,15,10,16,14,16,18,18,27,12,12,23,23,22,23,18,16,18,17
%N Number of 8's in n# (n primorial) = 8's in A002110(n).
%H Vincenzo Librandi, <a href="/A079134/b079134.txt">Table of n, a(n) for n = 2..1000</a>
%t DigitCount[#, 10, 8]&/@Rest[FoldList[Times, 1, Prime[Range[90]]]] (* _Harvey P. Dale_, Apr 04 2014 *)
%o (PARI) See program in Number of 0's in n#
%Y Cf. A002110.
%K easy,nonn
%O 2,12
%A _Cino Hilliard_, Feb 03 2003