cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

Original entry on oeis.org

0, 0, 0, 0, 0, 3, 23, 337, 3605, 38037, 380962, 3799462, 37594962
Offset: 1

Views

Author

Enoch Haga, Mar 02 2004

Keywords

Examples

			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

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

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