74093

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=9A001992
• 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=10A001992
• 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=11A001992
• 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=13A060085
• n*10^4-1, n*10^4-3, n*10^4-7 and n*10^4-9 are all prime.at n=20A064978
• a(n) = n^3 + 5.at n=42A084381
• 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=9A094847
• 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=10A094847
• 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=11A094847
• Records in A094847.at n=7A094849
• Records in A001992.at n=7A094852
• Primes of the form 2n^2+14n+5.at n=31A154577
• a(1)=2, a(n+1) is the smallest prime > n^smallest digit of a(n).at n=42A158061
• Greatest prime closest to n^3.at n=41A181758
• Least number k such that the first n primes have Kronecker symbol (p|k) = -1.at n=12A191088
• Least prime p such that the first n primes are not squares mod p.at n=12A191089
• Primes of the form k^3 + 5.at n=7A201260
• Increasing sequence of primes p such that all of 2,3,5,...,prime(n) are primitive roots mod p.at n=10A213052
• Primes having primitive roots 2, 3, 5, 7, 11, 13, and 17.at n=27A241048
• Primes p such that 2, 3, 5, 7, ..., 37 are all quadratic nonresidues modulo p.at n=1A306501