A092643 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

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: A270601 A361187 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