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

0, 0, 0, 0, 0, 3, 23, 337, 3605, 38037, 380962, 3799462, 37594962

Offset

1,6

Links

Table of n, a(n) for n=1..13.

Lucas A. Brown, Python program.

Formula

Generate the prime sequence with primes labeled 1 mod 4 or 3 mod 4. Add count of primes to sequence if just 10 primes occur before interruption by a prime congruent to 1 mod 4

Example

a(6)=3 because 3 sets of 10 primes occur below 10^6, each run interrupted by a prime congruent to 1 mod 4.

Crossrefs

Cf. A092663 A092665.

Sequence in context: A129458 A118184 A027486 * A363577 A260509 A073588

Adjacent sequences: A092661 A092662 A092663 * A092665 A092666 A092667

Keyword

more,nonn,hard

Author

Enoch Haga, Mar 02 2004

Extensions

a(9) and a(10) from Sean A. Irvine, Oct 06 2011

a(11) from Chai Wah Wu, Mar 18 2018

a(12) and a(13) from Lucas A. Brown, Oct 15 2024

Status

approved