login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A306891
Primes p for which pi_{3,2}(p) < pi_{3,1}(p), where pi_{m,a}(x) is the number of primes <= x which are congruent to a (mod m).
1
608981813029, 608981813137, 608981813191, 608981813261, 608981813269, 608981813273, 608981813311, 608981813347, 608981813357, 608981813449, 608981813459, 608981813683, 608981813701, 608981813707, 608981813711, 608981813717, 608981813719, 608981813777, 608981813779
OFFSET
1,1
COMMENTS
Primes p such that Sum_{primes q <= p} Kronecker(-3,q) > 0.
Indices of negative terms in A321856. See also the comment about Chebyshev's bias in A321856.
LINKS
C. Bays, R. H. Hudson, Details of the First Region of Integers x with pi_{3,2}(x) < pi_{3,1}(x), Mathematics of Computation 32(142), 1978, pp. 571-576.
Eric Weisstein's World of Mathematics, Chebyshev Bias
Wikipedia, Chebyshev's bias
FORMULA
a(n) = prime(A096630(n)).
PROG
(PARI) my(i=0); forprime(p=608981813029, 608981820000, i+=kronecker(-3, p); if(i>0, print1(p, ", ")))
CROSSREFS
KEYWORD
nonn
AUTHOR
Jianing Song, Mar 16 2019
STATUS
approved