4294967357domain: NAppears in sequencesa(n) = 2^(n+1) + 2*n - 1.at n=31A131898Primes of the form 2^n+2*n-3.at n=8A192436a(n) is the smallest prime greater than 2^n such that 2 is a primitive root modulo a(n).at n=32A250396