39089

Properties

Appears in sequences

• Third term of strong prime sextets: p(m-1)-p(m-2) > p(m)-p(m-1) > p(m+1)-p(m) > p(m+2)-p(m+1) > p(m+3)-p(m+2).at n=11A054815
• Value of C in y = x^2+7x+C such that y is prime for all x = 0 to 4.at n=32A097436
• Primes p such that 2p+1, 3p+2 and 5p-2 are also primes.at n=31A178068
• Cyclops Sophie-Germain primes.at n=27A183058
• Number of partitions p of n such that min(p) <= (number of parts of p) <= max(p).at n=43A325343
• Primes which yield again a prime when the digits are taken according to the lexicographically first superpermutation of corresponding order and of minimal length.at n=37A332088
• Primes p such that Sum_{k=PreviousPrime(p)..p} d(k) = Sum_{k=p..NextPrime(p)} d(k), where d(k) is the number of divisors function A000005.at n=31A353552
• a(n) = n! * Sum_{k=0..floor(n/2)} (k/2)^k / (k! * (n-2*k)!).at n=8A362350
• Smallest index k such that the k-th prime number in base-2 contains the n-th Fibonacci number in base-2 as a contiguous substring.at n=24A377270
• Prime numbersat n=4114