|
| |
|
|
A092652
|
|
Number of consecutive prime runs of 6 primes congruent to 3 mod 4 below 10^n.
|
|
2
| | |
|
|
|
OFFSET
| 1,5
|
|
|
FORMULA
| Generate the prime sequence with primes labeled 1 mod 4 or 3 mod 4. Add count of primes to sequence if just 6 primes occur before interruption by a prime congruent to 1 mod 4.
|
|
|
EXAMPLE
| a(5)=9 because 9 sets of 6 primes occur below 10^5, each run interrupted by a prime congruent to 1 mod 4.
|
|
|
CROSSREFS
| Cf. A092651 A092653.
Sequence in context: A081876 A139760 A112702 * A137051 A137059 A083084
Adjacent sequences: A092649 A092650 A092651 * A092653 A092654 A092655
|
|
|
KEYWORD
| more,nonn
|
|
|
AUTHOR
| Enoch Haga (Enokh(AT)comcast.net), Mar 02 2004
|
| |
|
|
