This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A085974 #18 Oct 30 2023 11:36:36 %S A085974 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 A085974 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 A085974 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 A085974 Number of 0's in the decimal expansion of prime(n). %H A085974 Reinhard Zumkeller, <a href="/A085974/b085974.txt">Table of n, a(n) for n = 1..10000</a> %e A085974 prime(26) = 101, so a(26) = 1 and prime(1230) = 10007, so a(1230) = 3. %t A085974 DigitCount[Prime[Range[100]],10,0] (* _Paolo Xausa_, Oct 30 2023 *) %o A085974 (Haskell) %o A085974 a085974 = count0 0 . a000040 where %o A085974 count0 c x | d == 0 = if x < 10 then c + 1 else count0 (c + 1) x' %o A085974 | otherwise = if x < 10 then c else count0 c x' %o A085974 where (x', d) = divMod x 10 %o A085974 -- _Reinhard Zumkeller_, Apr 08 2014 %Y A085974 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 A085974 Cf. A055641. %K A085974 base,nonn %O A085974 1,169 %A A085974 _Jason Earls_, Jul 06 2003