29761

Properties

Appears in sequences

• Primes of the form p^k - p + 1 for prime p.at n=21A034915
• Primes with 17 as smallest positive primitive root.at n=29A061329
• a(n) = n^3 - n + 1.at n=31A061600
• The last number for which a determinant of base-n numbers is nonzero.at n=29A079505
• Smallest prime of the form n*(n+1)*(n+2)...(n+k) + 1, k > 0, i.e., a(n) > n+1, or 0 if no such prime exists.at n=29A089305
• Smallest prime of the form n(n-1)(n-2)...(n-k)+1, or 0 if no such prime exists.at n=31A092927
• Primes of the form k^3 - k + 1.at n=13A100698
• Primes p such that q-p = 28, where q is the next prime after p.at n=25A124595
• Pascal-(1,9,1) array.at n=40A143685
• Chebyshev primes that begin a record gap to the next Chebyshev prime.at n=10A196673
• Primes of the form 2n^2 - 7.at n=33A201714
• Primes of the form 8n^2 - 7.at n=14A201858
• Primes p such that p = 361 + 420*k for some k.at n=29A217656
• Primes of form n^2 + 20736.at n=7A256840
• Start with k=2*n, and until k+1 is prime, apply the map k -> k*(least prime factor of (k+1)); then a(n) = k+1, or 0 if k+1 never reaches a prime.at n=31A288212
• Smallest prime p such that the Diophantine equation x + y + z = p with x*y*z = k^3 (0 < x <= y <= z) has exactly n solutions.at n=38A290401
• Primes of the form (k - 1) * k * (k + 1) +- 1, k >= 1.at n=28A293861
• a(n) is the least nonnegative integer k such that n OR k is a cube (where OR denotes the bitwise OR operator).at n=30A330272
• Value of prime number D for incrementally largest values of minimal x satisfying the equation x^2 - D*y^2 = 3.at n=24A336794
• Value of prime number D for incrementally largest values of minimal y satisfying the equation x^2 - D*y^2 = 3.at n=23A336796