%I #18 Oct 30 2023 11:36:36
%S 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,0,0,0,0,0,
%T 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,
%U 0,0,0,0,0,0,0,0,0,0,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,0,0,0,0,0,0,0,0
%N Number of 0's in the decimal expansion of prime(n).
%H Reinhard Zumkeller, <a href="/A085974/b085974.txt">Table of n, a(n) for n = 1..10000</a>
%e prime(26) = 101, so a(26) = 1 and prime(1230) = 10007, so a(1230) = 3.
%t DigitCount[Prime[Range[100]],10,0] (* _Paolo Xausa_, Oct 30 2023 *)
%o (Haskell)
%o a085974 = count0 0 . a000040 where
%o count0 c x | d == 0 = if x < 10 then c + 1 else count0 (c + 1) x'
%o | otherwise = if x < 10 then c else count0 c x'
%o where (x', d) = divMod x 10
%o -- _Reinhard Zumkeller_, Apr 08 2014
%Y Cf. 1's A085975, 2's A085976, 3's A085977, 4's A085978, 5's A085979, 6's A085980, 7's A085981, 8's A085982, 9's A085983.
%Y Cf. A055641.
%K base,nonn
%O 1,169
%A _Jason Earls_, Jul 06 2003