49552
domain: N
Appears in sequences
- Cube root of A030697.at n=22A030698
- For even k >= 4, let f(k) = A066285(k/2) be the minimal difference between primes p and q whose sum is k. Such a k is in the sequence if f(k) > f(m) for all even m with 4 <= m < k.at n=29A065978
- Numbers k such that 10^k + 2*R_k + 5 is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=13A102930
- Let p = prime(n). Smallest j such that q = j*2*p^3-1, r = j*p*2*q^2-1, s = j*p*2*r^2-1, and j*p*2*s^2-1 are prime numbers.at n=5A224612
- Triangular array T(n,k), read by rows: coefficients of strong divisibility sequence of polynomials p(1,x) = 1, p(2,x) = 1 + 2*x, p(n,x) = u*p(n-1,x) + v*p(n-2,x) for n >= 3, where u = p(2,x), v = 1 + 3*x^2.at n=52A368518