608981813017
domain: N
Appears in sequences
- Primes p such that the number of primes q, 5 <= q < p, congruent to 1 mod 3, is equal to the number of such primes congruent to 2 mod 3.at n=12A096449
- Consider the prime race mod q (where q >= 2) between q*k+1 and q*k-1. Terms are numbers k where q*k+1 first takes lead over q*k-1.at n=4A275939
- a(n) is the smallest prime p such that Sum_{primes q <= p} Kronecker(-n,q) > 0, or 0 if no such prime exists.at n=11A392284
- a(n) is the smallest prime p such that Sum_{primes q <= p} Kronecker(-n,q) > 0, or 0 if no such prime exists.at n=47A392284
- Primes p such that Pi_{3,1}(p) = Pi_{3,2}(p), where Pi_{m,n}(p) denotes the number of primes q <= p with q == n (mod m).at n=0A392294