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”).

A185712
a(n) = number of primes <= n that end in 3.
5
0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9
OFFSET
1,13
COMMENTS
Partial sums of A185706.
LINKS
A. Granville and G. Martin, Prime number races, arXiv:math/0408319 [math.NT], 2004.
A. Granville and G. Martin, Prime number races, Amer. Math. Monthly, 113 (No. 1, 2006), 1-33.
MATHEMATICA
Accumulate[Table[If[PrimeQ[n] && Mod[n, 10] == 3, 1, 0], {n, 50}]] (* G. C. Greubel, Jul 10 2017 *)
KEYWORD
base,nonn
AUTHOR
N. J. A. Sloane, Feb 10 2011
STATUS
approved