|
Search: id:A092636
|
|
|
| A092636 |
|
Number of consecutive prime runs of 1 prime congruent to 1 mod 4 below 10^n. |
|
+0
5
|
| |
|
|
OFFSET
|
1,2
|
|
|
FORMULA
|
Generate the prime sequence with primes labeled 1 mod 4 or 3 mod 4. Add count of primes to sequence if just one prime occurs before interruption by a prime congruent to 3 mod 4.
|
|
EXAMPLE
|
a(3)=31 because 31 single primes occur below 10^3, each interrupted in the run by a prime congruent to 3 mod 4.
|
|
CROSSREFS
|
Cf. A092637 A092638 A092639-92665.
Sequence in context: A164038 A084235 A002469 this_sequence A007197 A002649 A104091
Adjacent sequences: A092633 A092634 A092635 this_sequence A092637 A092638 A092639
|
|
KEYWORD
|
easy,more,nonn
|
|
AUTHOR
|
Enoch Haga (Enokh(AT)comcast.net), Mar 02 2004
|
|
|
Search completed in 0.002 seconds
|
