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

%I #13 Sep 08 2022 08:46:14

%S 4,7,13,23,43,77,145,275,535,1053,2079,4133,8233,16427,32815,65589,

%T 131131,262205,524355,1048647,2097225,4194383,8388691,16777305,

%U 33554529,67108965,134217831,268435563,536871021,1073741937,2147483775,4294967427,8589934729

%N a(n) = 2^n + prime(n).

%C 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

%F From _Wesley Ivan Hurt_, Dec 05 2015: (Start)

%F a(n) = A000079(n) + A000040(n), for n>0.

%F a(n) = A100484(n) + A111209(n). (End)

%p A265160:=n->2^n + ithprime(n): seq(A265160(n), n=1..40); # _Wesley Ivan Hurt_, Dec 05 2015

%t Table[2^n + Prime[n], {n, 40}]

%o (Magma) [NthPrime(n) + 2^n: n in [1..40]];

%o (PARI) a(n) = 2^n + prime(n); \\ _Altug Alkan_, Dec 03 2015

%Y Cf. A000040, A000079, A100484, A111209.

%K nonn,easy

%O 1,1

%A _Vincenzo Librandi_, Dec 03 2015

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 23 16:40 EDT 2024. Contains 371916 sequences. (Running on oeis4.)