A085983 Number of 9's in decimal expansion of prime(n).

0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 2, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 2, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0

Offset: 1

Author

Jason Earls, Jul 06 2003

Keywords

• base
• nonn

Links

• Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

Crossrefs

Cf. 0's A085974, 1's A085975, 2's A085976, 3's A085977, 4's A085978, 5's A085979, 6's A085980, 7's A085981, 8's A085982.

Programs

Haskell

a085983 = count9 0 . a000040 where
   count9 c x | d == 9    = if x < 10 then c + 1 else count9 (c + 1) x'
              | otherwise = if x < 10 then c else count9 c x'
              where (x', d) = divMod x 10
-- Reinhard Zumkeller, Apr 08 2014

Mathematica

DigitCount[#,10,9]&/@Prime[Range[110]] (* Harvey P. Dale, May 08 2018 *)