1811939329

Appears in sequences

• a(n) = n*2^(n-1) + 1.at n=27A005183
• a(n) = T(8,n), array T given by A048472.at n=24A048480
• Smallest prime p with bigomega(p-1)=n, where bigomega(m)=A001222(m) is the number of prime divisors of m (counted with multiplicity).at n=29A073919
• Primes that divide Fibonacci number F(2^k) for some k.at n=13A074714
• Smallest prime which is 1 more than the product of n (not necessarily distinct) composite numbers.at n=14A081546
• Primes of the form n*2^(n-1)+1.at n=6A196273
• Primes q such that Sum_(q-1; i=1..m) e(i)/p(i) is an integer k, where the prime factorization of n is Product_(n; i=1..m) p(i)^e(i).at n=21A267143
• a(n) is the least prime of the form 2^j*3^k + 1, j > 0, k > 0, j + k = n. a(n) = 0 if no such prime exists.at n=27A336773