|
|
A071838
|
|
a(n) = Pi(8,3)(n) + Pi(8,5)(n) - Pi(8,1)(n) - Pi(8,7)(n) where Pi(a,b)(x) denotes the number of primes in the arithmetic progression a*k + b less than or equal to x.
|
|
15
|
|
|
0, 0, 1, 1, 2, 2, 1, 1, 1, 1, 2, 2, 3, 3, 3, 3, 2, 2, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 3, 3, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 2, 2, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 4, 4, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 3, 3, 2, 2, 2
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,5
|
|
COMMENTS
|
a(n) is the number of odd primes <= n that have 2 as a quadratic nonresidue minus the number of primes <= n that have 2 as a quadratic residue. See the comments about "Chebyshev's bias" in A321861. - Jianing Song, Nov 24 2018
Although the initial terms are nonnegative, infinitely many terms should be negative. For which n does a(n) = -1?
The first negative term occurs at a(11100143) = -1. - Jianing Song, Nov 08 2019
|
|
LINKS
|
|
|
FORMULA
|
a(n) = -Sum_{primes p<=n} Kronecker(2,p) = -Sum_{primes p<=n} A091337(p). - Jianing Song, Nov 20 2018
|
|
MATHEMATICA
|
Accumulate@ Array[-If[PrimeQ@ #, KroneckerSymbol[2, #], 0] &, 105] (* Michael De Vlieger, Nov 25 2018 *)
|
|
PROG
|
(PARI) for(n=1, 200, print1(sum(i=1, n, if((i*isprime(i)-3)%8, 0, 1)+if((i*isprime(i)-5)%8, 0, 1)-if((i*isprime(i)-1)%8, 0, 1)-if((i*isprime(i)-7)%8, 0, 1)), ", ")) \\ Program fixed by Jianing Song, Nov 08 2019
(PARI) a(n) = -sum(i=1, n, isprime(i)*kronecker(2, i)) \\ Jianing Song, Nov 24 2018
|
|
CROSSREFS
|
Let d be a fundamental discriminant.
|
|
KEYWORD
|
easy,sign
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|