This site is supported by donations to The OEIS Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A091295 (Number of primes == 3 mod 4 less than 10^n) - (number of primes == 1 mod 4 less than 10^n). 3
 1, 2, 7, 10, 25, 147, 218, 446, 551, 5960, 14252, 63337, 118472, 183457, 951700, 3458334, 6284060, 2581691, 80743228, 259753425 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 REFERENCES Hans Riesel, Prime Numbers and Computer Methods for Factorization, 2nd ed., Birkhauser, The distribution of primes between the two series 4n+1 and 4n+3, pages 73-77, with graphs. LINKS Marc Deléglise, Pierre Dusart, and Xavier-Francois Roblot, Counting primes in residue classes, Math. Comp. 73 (2004), no. 247, 1565-1575. Carlos Rivera, Puzzle 256, Jack Brennen old records,  The Prime Puzzles & Problems Connection. FORMULA a(n) = A091099(n) - A091098(n) = A093153(n) + 1. [Max Alekseyev, May 17 2009] EXAMPLE a(1) = 1 because below 10^1 3 and 7 are 3 mod 4 and 5 is 1 mod 4 and the difference is 2-1=1. CROSSREFS Cf. A091098, A091099. A002144, A002145, A091318, A091267. Sequence in context: A066967 A222450 A032007 * A215407 A084184 A015963 Adjacent sequences:  A091292 A091293 A091294 * A091296 A091297 A091298 KEYWORD nonn,more AUTHOR Enoch Haga, Feb 23 2004 EXTENSIONS a(17)-a(20) from Marc Deleglise, Jun 28 2007 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
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 19 03:38 EST 2019. Contains 319283 sequences. (Running on oeis4.)