64590

Appears in sequences

• Consider the sequence {b(m)} of composite numbers (excluding 1); sequence gives values of b(m) where gcd(m, b(m)) increases.at n=32A058012
• a(n) is the smallest number m such that (2*k-1)*m+1 is prime for all 0<k<n+1.at n=5A164325
• Smallest k such that k*2*p(n)^2-1=q is prime, k*2*q^2-1=r, k*2*r^2-1=s, k*2*r^2-1=t, r, s, and t are also prime.at n=6A224492