|
Search: id:A092643
|
|
|
| A092643 |
|
Number of consecutive prime runs of 3 primes congruent to 3 mod 4 below 10^n. |
|
+0
5
|
| |
|
|
OFFSET
|
1,4
|
|
|
FORMULA
|
Generate the prime sequence with primes labeled 1 mod 4 or 3 mod 4. Add count of primes to sequence if just 3 primes occur before interruption by a prime congruent to 1 mod 4.
|
|
EXAMPLE
|
a(5)=323 because 323 sets of 3 primes occur below 10^5, each run interrupted by a prime congruent to 1 mod 4.
|
|
CROSSREFS
|
Cf. A092642 A092644.
Sequence in context: A017462 A067741 A073972 this_sequence A045786 A017594 A014800
Adjacent sequences: A092640 A092641 A092642 this_sequence A092644 A092645 A092646
|
|
KEYWORD
|
easy,more,nonn
|
|
AUTHOR
|
Enoch Haga (Enokh(AT)comcast.net), Mar 02 2004
|
|
|
Search completed in 0.002 seconds
|
