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 A129963 #14 Jul 04 2024 03:34:33
%S A129963 5,67,262153,1073741839,18889465931478580854821,
%T A129963 1496577676626844588240573268701473812127674924007509,
%U A129963 118571099379011784113736688648896417641748464297615937576404566024103044751294597
%N A129963 Primes of the form 4^k + k.
%C A129963 It is convenient, although not necessary, to let k be an odd number since k even => 4^k + k is even > 2.
%C A129963 Conjecture: sequence is infinite.
%C A129963 The next term (a(8)) has 126 digits. - _Harvey P. Dale_, Jun 05 2014
%H A129963 Amiram Eldar, <a href="/A129963/b129963.txt">Table of n, a(n) for n = 1..9</a>
%F A129963 a(n) = A158879(A057909(n)). - _Amiram Eldar_, Jul 04 2024
%e A129963 For k = 3, 4^3 + 3 = 67 is prime.
%t A129963 Select[Table[4^n+n,{n,1,251,2}],PrimeQ] (* _Harvey P. Dale_, Jun 05 2014 *)
%o A129963 (PARI) f(n) = for(x=1,n,y=2^x+x;if(isprime(y),print1(y",")))
%Y A129963 Cf. A057909, A158879.
%K A129963 nonn
%O A129963 1,1
%A A129963 _Cino Hilliard_, Jun 10 2007, Aug 20 2007