|
Search: id:A092648
|
|
|
| A092648 |
|
Number of consecutive prime runs of 5 primes congruent to 1 mod 4 below 10^n. |
|
+0
3
|
| |
|
|
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 5 primes occur before interruption by a prime congruent to 3 mod 4.
|
|
EXAMPLE
|
a(6)=344 because 344 sets of 5 primes occur below 10^6, each run interrupted by a prime congruent to 3 mod 4.
|
|
CROSSREFS
|
Cf. A092649 A092650.
Sequence in context: A003691 A038146 A067444 this_sequence A026121 A055303 A068177
Adjacent sequences: A092645 A092646 A092647 this_sequence A092649 A092650 A092651
|
|
KEYWORD
|
easy,more,nonn
|
|
AUTHOR
|
Enoch Haga (Enokh(AT)comcast.net), Mar 02 2004
|
|
|
Search completed in 0.002 seconds
|
