A092643 - OEIS

The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

A092643

Number of consecutive prime runs of 3 primes congruent to 3 mod 4 below 10^n.

0, 0, 1, 36, 323, 2480, 20947, 183898, 1621279, 14492365, 131016136 (list; graph; refs; listen; history; text; internal format)

	OFFSET	`1,4`
	LINKS	`Table of n, a(n) for n=1..11.`
	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 1 mod 4.`
	EXAMPLE	`a(5)=323 because 323 sets of 3 primes occur below 10^5, each run interrupted by a prime congruent to 1 mod 4.`
	CROSSREFS	`Cf. A092642, A092644.` `Sequence in context: A222860 A270601 A232828 * A045786 A237128 A171586` `Adjacent sequences: A092640 A092641 A092642 * A092644 A092645 A092646`
	KEYWORD	`more,nonn`
	AUTHOR	`Enoch Haga, Mar 02 2004`
	EXTENSIONS	`a(9)-a(11) from Chai Wah Wu, Mar 18 2018`
	STATUS	`approved`

Last modified January 28 06:00 EST 2021. Contains 340490 sequences. (Running on oeis4.)