|
| |
|
|
A092640
|
|
Number of consecutive prime runs of 2 primes congruent to 3 mod 4 below 10^n.
|
|
5
| | |
|
|
|
OFFSET
| 1,2
|
|
|
FORMULA
| Generate the prime sequence with primes labeled 1 mod 4 or 3 mod 4. Add count of primes to sequence if just 2 primes occur before interruption by a prime congruent to 1 mod 4.
|
|
|
EXAMPLE
| a(4)=101 because 101 pairs of primes occur below 10^4, each run interrupted by a prime congruent to 1 mod 4.
|
|
|
CROSSREFS
| Cf. A092640 A092641.
Sequence in context: A026118 A108509 A110595 * A165961 A109500 A137961
Adjacent sequences: A092637 A092638 A092639 * A092641 A092642 A092643
|
|
|
KEYWORD
| more,nonn
|
|
|
AUTHOR
| Enoch Haga (Enokh(AT)comcast.net), Mar 02 2004
|
| |
|
|
