login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
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
LINKS
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
Sequence in context: A139217 A038391 A073832 * A090854 A039694 A341843
KEYWORD
nonn,easy
AUTHOR
Vincenzo Librandi, Dec 03 2015
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 18:58 EDT 2024. Contains 371781 sequences. (Running on oeis4.)