2004917

Properties

Appears in sequences

• Let p = n-th odd prime. Then a(n) = least prime congruent to 5 modulo 8 such that Legendre(a(n), q) = -1 for all odd primes q <= p.at n=15A001992
• Let p = n-th odd prime. Then a(n) = least prime congruent to 5 modulo 8 such that Legendre(a(n), q) = -1 for all odd primes q <= p.at n=16A001992
• a(n) gives least prime for which the n-th prime is the least prime which is not a primitive root of a(n) (see A060084), or 0 if the n-th prime never occurs in A060084.at n=18A060085
• Let p = n-th odd prime. Then a(n) = least positive integer congruent to 5 modulo 8 such that Legendre(a(n), q) = -1 for all odd primes q <= p.at n=16A094847
• Records in A094847.at n=10A094849
• Records in A001992.at n=11A094852
• a(n) = least prime p such that there are n consecutive even numbers E < 2 sqrt(p) such that E^2-p is prime.at n=18A157185
• a(n) = least prime p such that there are n consecutive even numbers E < 2 sqrt(p) such that E^2-p is prime.at n=19A157185
• a(n) = least prime p such that there are n consecutive even numbers E < 2 sqrt(p) such that E^2-p is prime.at n=20A157185
• Least number k such that the first n primes have Kronecker symbol (p|k) = -1.at n=17A191088
• Least prime p such that the first n primes are not squares mod p.at n=16A191089
• Least prime p such that the first n primes are not squares mod p.at n=17A191089
• Increasing sequence of primes p such that all of 2,3,5,...,prime(n) are primitive roots mod p.at n=16A213052
• Least prime p > prime(n+1) such that p is not a square mod the first n odd primes 3, 5, 7, 11, ..., prime(n+1).at n=16A237437
• Primes p such that 2, 3, 5, 7, ..., 37 are all quadratic nonresidues modulo p.at n=28A306501
• a(n) is the least prime p = prime(k) > prime(n) such that A306530(k) = prime(n).at n=18A307965
• Prime numbersat n=149271