|
Search: id:A092664
|
|
|
| A092664 |
|
Number of consecutive prime runs of 10 primes congruent to 3 mod 4 below 10^n. |
|
+0
3
|
| |
|
|
OFFSET
|
1,6
|
|
|
FORMULA
|
Generate the prime sequence with primes labeled 1 mod 4 or 3 mod 4. Add count of primes to sequence if just 10 primes occur before interruption by a prime congruent to 1 mod 4
|
|
EXAMPLE
|
a(6)=3 because 3 sets of 10 primes occur below 10^6, each run interrupted by a prime congruent to 1 mod 4.
|
|
CROSSREFS
|
Cf. A092663 A092665.
Sequence in context: A129458 A118184 A027486 this_sequence A073588 A068338 A114601
Adjacent sequences: A092661 A092662 A092663 this_sequence A092665 A092666 A092667
|
|
KEYWORD
|
easy,more,nonn
|
|
AUTHOR
|
Enoch Haga (Enokh(AT)comcast.net), Mar 02 2004
|
|
|
Search completed in 0.002 seconds
|
