|
Search: id:A092658
|
|
|
| A092658 |
|
Number of consecutive prime runs of 8 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 8 primes occur before interruption by a prime congruent to 1 mod 4.
|
|
EXAMPLE
|
a(6)=11 because 11 sets of 8 primes occur below 10^6, each run interrupted by a prime congruent to 1 mod 4.
|
|
CROSSREFS
|
Cf. A092657 A092659.
Adjacent sequences: A092655 A092656 A092657 this_sequence A092659 A092660 A092661
Sequence in context: A119571 A089920 A118197 this_sequence A113314 A014458 A099733
|
|
KEYWORD
|
easy,more,nonn
|
|
AUTHOR
|
Enoch Haga (Enokh(AT)comcast.net), Mar 02 2004
|
|
|
Search completed in 0.002 seconds
|
