A085979 Number of 5's in decimal expansion of prime(n).
0, 0, 1, 0, 0, 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, 0, 0, 0, 1, 1, 0, 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, 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, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1
Offset: 1
Links
- Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
Crossrefs
Programs
-
Haskell
a085979 = count5 0 . a000040 where count5 c x | d == 5 = if x < 10 then c + 1 else count5 (c + 1) x' | otherwise = if x < 10 then c else count5 c x' where (x', d) = divMod x 10 -- Reinhard Zumkeller, Apr 08 2014
-
Mathematica
DigitCount[Prime[Range[100]],10,5] (* Paolo Xausa, Oct 30 2023 *)