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