32783

Properties

Appears in sequences

• a(n) = 2^n + n.at n=15A006127
• Trajectory of 1 under map n->45n+1 if n odd, n->n/2 if n even.at n=11A033978
• Primes of the form 2^i*3^j + (i+j) with i, j >= 0.at n=13A069358
• Smallest prime p such that p - n is an n-th power, or 0 if no such number exists; i.e., smallest prime of the form k^n + n.at n=14A084047
• Primes of the form m^k+k, with m and k > 1.at n=24A099227
• Primes of the form 2^q + q where q is not a prime.at n=2A100339
• Primes in A103377.at n=16A103387
• Consider primes p and q such that p = 2^k + 15 and q = 2^(k+1) + 15 for some k; sequence gives values of p.at n=7A108266
• Prime Friedman numbers.at n=23A112419
• Primes of the form 2^k + k.at n=4A129962
• Primes of the form 2^k + 15.at n=10A144487
• Smallest emirp corresponding to the prime of A178583.at n=12A178584
• Primes of the form p(i)*p(i+1)+p(i+2)+p(i+3) where p(i) is a prime.at n=17A180947
• Primes of the form 2^x + 2^y - 1.at n=38A188713
• Where powers of 2 occur in the union of squares and powers of 2.at n=30A188917
• Number of n X 3 0..2 arrays with rows and columns lexicographically nondecreasing read forwards and nonincreasing read backwards.at n=11A201695
• Primes of the form m = 2^i + 2^j - 1, where i > j >= 0.at n=33A239712
• Numbers n such that a digit of n to the power k plus the sum of the other digits of n equals n, where k is a positive integer.at n=21A257860
• Primes of the form 2^x + y (x >= 0 and 0 <= y < 2^x) such that all the numbers 2^(x+a) + (y-a) (0 < a <= y) are composite.at n=29A264866
• Permutation of natural numbers: a(1) = 0, after which, a(2n) = A087686(1+a(n)), a(2n+1) = A088359(a(A268674(2n+1))).at n=52A269852