|
Search: id:A092654
|
|
|
| A092654 |
|
Number of consecutive prime runs of 7 primes congruent to 1 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 3 mod 4.
|
|
EXAMPLE
|
a(5)=2 because 2 sets of 7 primes occur below 10^5, each run interrupted by a prime congruent to 3 mod 4.
|
|
CROSSREFS
|
Cf. A092655 A092656.
Sequence in context: A041241 A019579 A151583 this_sequence A100101 A090601 A071777
Adjacent sequences: A092651 A092652 A092653 this_sequence A092655 A092656 A092657
|
|
KEYWORD
|
easy,more,nonn
|
|
AUTHOR
|
Enoch Haga (Enokh(AT)comcast.net), Mar 02 2004
|
|
|
Search completed in 0.002 seconds
|
