|
Search: id:A092198
|
|
|
| A092198 |
|
Equal count of primes congruent to 1 mod 4 and 3 mod 4 associated with primes in A007351 (the zero beginning the sequence indicates the prime 2). |
|
+0
1
|
|
| 0, 1, 3, 6, 44, 1471, 1472, 1473, 1474, 1475, 1476, 25185, 25187, 25188, 15189, 25190, 25196, 25206, 25211, 25212, 25213, 25214, 25215, 25216, 25217, 25218, 25219, 25222, 25224, 25225, 25251, 25253, 25257, 25258, 25410, 25421, 25426, 25427
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
FORMULA
|
Compute the running totals of primes congruent to 1 mod 4 and primes congruent to 3 mod 4. When these totals are equal, include in the sequence.
|
|
EXAMPLE
|
a(3)=3 because at this point there are 3 primes congruent to 1 mod 4: 5, 13, 17 and 3 primes congruent to 3 mod 4: 3, 7, 11.
|
|
CROSSREFS
|
Cf. A007351.
Sequence in context: A002028 A116315 A001886 this_sequence A133005 A009581 A088674
Adjacent sequences: A092195 A092196 A092197 this_sequence A092199 A092200 A092201
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Enoch Haga (Enokh(AT)comcast.net), Feb 24 2004
|
|
|
Search completed in 0.002 seconds
|
