1728061733

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=22A001992
• 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=23A001992
• 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=24A001992
• 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=25A001992
• 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=30A060085
• 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=26A094847
• Records in A094847.at n=16A094849
• Records in A001992.at n=17A094852
• Least prime p such that the first n primes are not squares mod p.at n=24A191089
• Least prime p such that the first n primes are not squares mod p.at n=25A191089
• Least prime p such that the first n primes are not squares mod p.at n=26A191089
• Least prime p such that the first n primes are not squares mod p.at n=27A191089
• Least prime p such that the first n primes are not squares mod p.at n=28A191089
• Least prime p such that the first n primes are not squares mod p.at n=29A191089
• a(n) = smallest number congruent to a quadratic non-residue modulo each of the first n odd primes.at n=28A206095
• Increasing sequence of primes p such that all of 2,3,5,...,prime(n) are primitive roots mod p.at n=23A213052
• a(n) is the least prime p = prime(k) > prime(n) such that A306530(k) = prime(n).at n=30A307965