|
Search: id:A092655
|
|
|
| A092655 |
|
Number of consecutive prime runs of 7 primes congruent to 3 mod 4 below 10^n. |
|
+0
3
|
| |
|
|
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 7 primes occur before interruption by a prime congruent to 1 mod 4.
|
|
EXAMPLE
|
a(5)=6 because 6 sets of 7 primes occur below 10^5, each run interrupted by a prime congruent to 1 mod 4.
|
|
CROSSREFS
|
Cf. A092654 A092656.
Sequence in context: A155613 A166177 A093142 this_sequence A099140 A048348 A025749
Adjacent sequences: A092652 A092653 A092654 this_sequence A092656 A092657 A092658
|
|
KEYWORD
|
easy,more,nonn
|
|
AUTHOR
|
Enoch Haga (Enokh(AT)comcast.net), Mar 02 2004
|
|
|
Search completed in 0.002 seconds
|
