login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A073506 Number of primes == 3 (mod 10) less than 10^n. 3
1, 7, 42, 310, 2402, 19665, 166230, 1440474, 12712499, 113765625 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Also Pi(n,5,3)

This and the related sequences A073505-A073517 and A006880, A073548-A073565 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

FORMULA

A073505(n) + a(n) + A073507(n) + A073508(n) + 2 = A006880(n).

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. A006880, A073505, A073507, A073508, A073509, A073510, A073511, A073512, A073513, A073514, A073515, A073516, A073517.

Sequence in context: A187246 A278152 A271427 * A025593 A218124 A048862

Adjacent sequences:  A073503 A073504 A073505 * A073507 A073508 A073509

KEYWORD

base,nonn,more

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

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

License Agreements, Terms of Use, Privacy Policy .

Last modified May 21 07:12 EDT 2018. Contains 304361 sequences. (Running on oeis4.)