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 A129962 #19 May 31 2025 08:57:34
%S A129962 3,11,37,521,32783,549755813927,37778931862957161709643,
%T A129962 2417851639229258349412433,618970019642690137449562201,
%U A129962 266998379490113760299377713271194014325338065294581596243380200977777465722580068752870260867389
%N A129962 Primes of the form 2^k + k.
%C A129962 It is convenient, although not necessary, to let k be an odd number since k even => 2^k + k is even > 2.
%C A129962 Conjecture: sequence is infinite.
%C A129962 If k is prime we have A057664.
%H A129962 Hugo Pfoertner, <a href="/A129962/b129962.txt">Table of n, a(n) for n = 1..16</a>
%e A129962 For k = 3, 2^3 + 3 = 11 prime, so 11 is a term.
%t A129962 Select[Table[2^n+n,{n,600}],PrimeQ[#]&] (* _Vladimir Joseph Stephan Orlovsky_, Feb 18 2011 *)
%o A129962 (PARI) f(n) = forstep(x=1,n,2,y=2^x+x;if(isprime(y),print1(y",")))
%o A129962 (Magma) [a: n in [0..400] | IsPrime(a) where a is 2^n + n]; // _Vincenzo Librandi_, Jul 25 2019
%Y A129962 Cf. A052007 (values of k), A057664, A081296.
%K A129962 nonn
%O A129962 1,1
%A A129962 _Cino Hilliard_, Jun 10 2007