|
| |
|
|
A092642
|
|
Number of consecutive prime runs of 3 primes congruent to 1 mod 4 below 10^n.
|
|
4
| | |
|
|
|
OFFSET
| 1,3
|
|
|
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 3 mod 4.
|
|
|
EXAMPLE
| a(5)=305 because 305 sets of 3 primes occur below 10^5, each run interrupted by a prime congruent to 3 mod 4.
|
|
|
CROSSREFS
| Cf. A092643 A092644.
Sequence in context: A196851 A196702 A196945 * A020865 A155859 A192947
Adjacent sequences: A092639 A092640 A092641 * A092643 A092644 A092645
|
|
|
KEYWORD
| more,nonn
|
|
|
AUTHOR
| Enoch Haga (Enokh(AT)comcast.net), Mar 02 2004
|
| |
|
|
