login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A265160
a(n) = 2^n + prime(n).
1
4, 7, 13, 23, 43, 77, 145, 275, 535, 1053, 2079, 4133, 8233, 16427, 32815, 65589, 131131, 262205, 524355, 1048647, 2097225, 4194383, 8388691, 16777305, 33554529, 67108965, 134217831, 268435563, 536871021, 1073741937, 2147483775, 4294967427, 8589934729
OFFSET
1,1
COMMENTS
a(n) is odd for n>1. The first few primes in this sequence are 7, 13, 23, 43, 4133, 8233, 16427, 8388691, ... . - Wesley Ivan Hurt, Dec 05 2015
FORMULA
From Wesley Ivan Hurt, Dec 05 2015: (Start)
a(n) = A000079(n) + A000040(n), for n>0.
a(n) = A100484(n) + A111209(n). (End)
MAPLE
A265160:=n->2^n + ithprime(n): seq(A265160(n), n=1..40); # Wesley Ivan Hurt, Dec 05 2015
MATHEMATICA
Table[2^n + Prime[n], {n, 40}]
PROG
(Magma) [NthPrime(n) + 2^n: n in [1..40]];
(PARI) a(n) = 2^n + prime(n); \\ Altug Alkan, Dec 03 2015
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Vincenzo Librandi, Dec 03 2015
STATUS
approved