The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A085974 Number of 0's in the decimal expansion of prime(n). 11
 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, 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, 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,169 LINKS Reinhard Zumkeller, Table of n, a(n) for n = 1..10000 EXAMPLE prime(26) = 101, so a(26) = 1 and prime(1230) = 10007, so a(1230) = 3. MATHEMATICA DigitCount[Prime[Range[100]], 10, 0] (* Paolo Xausa, Oct 30 2023 *) PROG (Haskell) a085974 = count0 0 . a000040 where count0 c x | d == 0 = if x < 10 then c + 1 else count0 (c + 1) x' | otherwise = if x < 10 then c else count0 c x' where (x', d) = divMod x 10 -- Reinhard Zumkeller, Apr 08 2014 CROSSREFS 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. Cf. A055641. Sequence in context: A277165 A011740 A354344 * A011739 A023975 A305821 Adjacent sequences: A085971 A085972 A085973 * A085975 A085976 A085977 KEYWORD base,nonn AUTHOR Jason Earls, Jul 06 2003 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified July 24 23:57 EDT 2024. Contains 374585 sequences. (Running on oeis4.)