The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons 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!)
 A092642 Number of consecutive prime runs of 3 primes congruent to 1 mod 4 below 10^n. 4
 0, 0, 4, 38, 305, 2450, 20939, 182955, 1618599, 14491882, 131026137 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 LINKS FORMULA Generate the prime sequence with primes labeled 1 mod 4 or 3 mod 4. Add count of primes to sequence if just 3 primes occur before interruption by a prime congruent to 3 mod 4. EXAMPLE a(5)=305 because 305 sets of 3 primes occur below 10^5, each run interrupted by a prime congruent to 3 mod 4. MATHEMATICA A002145 = Join[{0}, Select[4 Range[0, 10^4] + 3, PrimeQ[#] &]]; A002144 = Select[4 Range[0, 10^4] + 1, PrimeQ[#] &]; lst = {}; Do[If[Length[s = Select[A002144, Between[{A002145[[i]], A002145[[i + 1]]}]]] == 3, AppendTo[lst, Last[s]]], {i, Length[A002145] - 1}]; Table[Count[lst, x_ /; x < 10^n], {n, 4}]  (* Robert Price, Jun 09 2019 *) CROSSREFS Cf. A092643, A092644. Sequence in context: A196702 A196945 A240287 * A020865 A240378 A220807 Adjacent sequences:  A092639 A092640 A092641 * A092643 A092644 A092645 KEYWORD more,nonn AUTHOR Enoch Haga, Mar 02 2004 EXTENSIONS a(9)-a(11) from Chai Wah Wu, Mar 18 2018 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 15 19:32 EST 2021. Contains 340189 sequences. (Running on oeis4.)