A085982 Number of 8's in decimal expansion of prime(n).
0, 0, 0, 0, 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, 0, 1, 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, 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, 0, 0, 0, 0, 0
Offset: 1
Links
- Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
Crossrefs
Programs
-
Haskell
a085982 = count8 0 . a000040 where count8 c x | d == 8 = if x < 10 then c + 1 else count8 (c + 1) x' | otherwise = if x < 10 then c else count8 c x' where (x', d) = divMod x 10 -- Reinhard Zumkeller, Apr 08 2014
-
Mathematica
DigitCount[Prime[Range[150]],10,8](* Harvey P. Dale, Jun 11 2016 *)