4294967681domain: NAppears in sequencesPrimes of the form 2^(2^k)+385.at n=4A160030a(n) is the smallest k > 2^(2^n)+1 such that 2^(k-1) == 1 (mod (2^(2^n)-1)*k).at n=5A307532Smallest Sophie Germain prime >= 2^n.at n=32A367966