61613

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=8A001992
• 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=10A060085
• Records in A001992.at n=6A094852
• Largest prime factor of n!! + (n+1)!!.at n=34A118333
• a(n) = (n^6 - 126*n^5 + 6217*n^4 - 153066*n^3 + 1987786*n^2 - 13055316*n + 34747236)/36.at n=28A121888
• Home primes whose homeliness is 5.at n=27A133964
• Numbers k such that k and k^2 use only the digits 1, 3, 6, 7 and 9.at n=21A137039
• Primes A080478(n)^2 + A080478(n+1)^2.at n=32A139361
• For n>=1, a(n) = n + 2 + Sum_{i=1..n-1} a(i)*a(n-i).at n=5A173998
• Numbers m such that the sum of the first k odd primes = m-th odd prime.at n=35A179321
• Primes of the form 5n^2 + 8.at n=15A201486
• Primes formed by concatenating k, k and 3 for k >= 1.at n=15A210512
• Increasing sequence of primes p such that all of 2,3,5,...,prime(n) are primitive roots mod p.at n=9A213052
• Seventh prime p such that (p+n)^2+n is prime but (p+j)^2+j is not prime for all 0<j<n.at n=38A238679
• Primes having primitive roots 2, 3, 5, 7, 11, 13, and 17.at n=21A241048
• Consider a number n with m decimal digits. The sequence lists the numbers n having the prefix of length m-1 in the middle of the decimal expansion of n^2.at n=16A242942
• Primes of the form abs(1/(36)(n^6 - 126n^5 + 6217n^4 - 153066n^3 + 1987786n^2 - 13055316n + 34747236)) in order of increasing nonnegative n.at n=28A272555
• a(n) is the number of tetrapods standing on the four edges of an n X n grid, so that no two feet are the same distance apart and no foot is on a corner. Tetrapods with congruent footprints are counted only once.at n=26A353447
• Prime numbersat n=6198