87803

Properties

Appears in sequences

• Primes p whose order of primeness A049076(p) is >= 6.at n=5A049202
• Primes for which A049076(p) >= 5.at n=12A049203
• Prime recurrence: a(n+1) = a(n)-th prime, with a(1) = 6.at n=6A057451
• a(n) is obtained by applying the map k -> prime(k) n times, starting at n.at n=5A058009
• Primes for which A049076(p) = 7.at n=2A058322
• Dispersion of the primes (an array read by downward antidiagonals).at n=38A114537
• Square array T[i+1,j] = prime(T[i,j]), T[1,j] = j-th nonprime = A018252(j); read by upward antidiagonals.at n=42A138947
• Larger of two consecutive prime numbers, p1 and p2 = p1 + d, such that p1*p2*d - d is the average of twin primes.at n=9A153379
• Primes p such that 2*p^5-+3 are also prime.at n=19A174368
• Primes of the form 4*n^3-5.at n=9A200732
• Primes of the form 7n^2 - 5.at n=21A201851
• Primes that are exactly between the nearest square and the nearest triangular number.at n=31A233443
• Array T(n,k) read along descending antidiagonals: row n contains the primes with n steps in the prime index chain.at n=33A236542
• Prime numbers with prime indices in A333243.at n=31A333244
• Matula-Goebel numbers of rooted trees whose number of nodes is one more than their node-height.at n=34A358731
• Rectangular array read by antidiagonals: A(n,k) = prime(A114537(n,k)).at n=30A370094
• Prime numbersat n=8527