This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A265160 #13 Sep 08 2022 08:46:14
%S A265160 4,7,13,23,43,77,145,275,535,1053,2079,4133,8233,16427,32815,65589,
%T A265160 131131,262205,524355,1048647,2097225,4194383,8388691,16777305,
%U A265160 33554529,67108965,134217831,268435563,536871021,1073741937,2147483775,4294967427,8589934729
%N A265160 a(n) = 2^n + prime(n).
%C A265160 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 A265160 From _Wesley Ivan Hurt_, Dec 05 2015: (Start)
%F A265160 a(n) = A000079(n) + A000040(n), for n>0.
%F A265160 a(n) = A100484(n) + A111209(n). (End)
%p A265160 A265160:=n->2^n + ithprime(n): seq(A265160(n), n=1..40); # _Wesley Ivan Hurt_, Dec 05 2015
%t A265160 Table[2^n + Prime[n], {n, 40}]
%o A265160 (Magma) [NthPrime(n) + 2^n: n in [1..40]];
%o A265160 (PARI) a(n) = 2^n + prime(n); \\ _Altug Alkan_, Dec 03 2015
%Y A265160 Cf. A000040, A000079, A100484, A111209.
%K A265160 nonn,easy
%O A265160 1,1
%A A265160 _Vincenzo Librandi_, Dec 03 2015