A085980 Number of 6's in decimal expansion of prime(n).
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, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0
Offset: 1
Links
- Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
Crossrefs
Programs
-
Haskell
a085980 = count6 0 . a000040 where count6 c x | d == 6 = if x < 10 then c + 1 else count6 (c + 1) x' | otherwise = if x < 10 then c else count6 c x' where (x', d) = divMod x 10 -- Reinhard Zumkeller, Apr 08 2014
-
Mathematica
Table[DigitCount[n,10,6],{n,Prime[Range[110]]}] (* Harvey P. Dale, Mar 20 2018 *)