|
|
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
|
|
|
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
|
|
CROSSREFS
|
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|