login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A327462
Number of holes in decimal expansion of n-th prime.
2
0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 2, 3, 1, 1, 1, 1, 2, 0, 0, 0, 0, 1, 2, 0, 0, 1, 1, 0, 1, 2, 1, 1, 1, 2, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 2, 0, 0, 2, 2, 1, 1, 0, 0, 0, 0, 0, 1, 2, 0, 1, 1, 0, 1, 2, 3, 1, 2, 3, 2, 1, 1, 1, 2
OFFSET
1,23
COMMENTS
This is A064692 restricted to the primes.
LINKS
PROG
(PARI) forprime (p=2, 439, print1 (vecsum(apply(d -> [1, 0, 0, 0, 1, 0, 1, 0, 2, 1][1+d], digits(p))) ", ")) \\ Rémy Sigrist, Sep 27 2019
CROSSREFS
KEYWORD
nonn,base
AUTHOR
N. J. A. Sloane, Sep 27 2019
STATUS
approved