

A073506


Number of primes == 3 (mod 10) less than 10^n.


4




OFFSET

1,2


COMMENTS

Also Pi(n,5,3)
This and the related sequences A073505A073517 and A002280, A073548A073565 are included because there is interest in the distribution of primes by their initial or final digits.


LINKS

Table of n, a(n) for n=1..10.
Eric Weisstein's World of Mathematics, Modular Prime Counting Function


EXAMPLE

a(2)=7 because there are 7 primes == 3 (mod 10) less than 10^2. They are 3, 13, 23, 43, 53, 73 and 83.


MATHEMATICA

c = 0; k = 3; Do[While[k < 10^n, If[PrimeQ[k], c++ ]; k += 10]; Print[c], {n, 1, 10}]


CROSSREFS

Cf. A073509 to A073517. A073505(n) + A073506(n) + A073507(n) + A073508(n) + 1 = A006880(n).
Sequence in context: A187246 A278152 A271427 * A025593 A218124 A048862
Adjacent sequences: A073503 A073504 A073505 * A073507 A073508 A073509


KEYWORD

base,nonn


AUTHOR

Shyam Sunder Gupta, Aug 14 2002


EXTENSIONS

Edited by Robert G. Wilson v, Oct 03 2002
a(10) from Robert G. Wilson v, Dec 22 2003


STATUS

approved



