|
Search: id:A092651
|
|
|
| A092651 |
|
Number of consecutive prime runs of 6 primes congruent to 1 mod 4 below 10^n. |
|
+0
3
|
| |
|
|
OFFSET
|
1,5
|
|
|
FORMULA
|
Generate the prime sequence with primes labeled 1 mod 4 or 3 mod 4. Add count of primes to sequence if just 6 primes occur before interruption by a prime congruent to 3 mod 4.
|
|
EXAMPLE
|
a(5)=9 because 9 sets of 6 primes occur below 10^5, each run interrupted by a prime congruent to 3 mod 4.
|
|
CROSSREFS
|
Cf. A092652 A092653.
Sequence in context: A065086 A065707 A034301 this_sequence A073014 A046754 A064746
Adjacent sequences: A092648 A092649 A092650 this_sequence A092652 A092653 A092654
|
|
KEYWORD
|
easy,more,nonn
|
|
AUTHOR
|
Enoch Haga (Enokh(AT)comcast.net), Mar 02 2004
|
|
|
Search completed in 0.002 seconds
|
