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 A102634 #25 Nov 12 2023 08:44:25
%S A102634 2,4,8,20,38,64,80,292,1132,4108,19934,125278,175628,282184
%N A102634 Numbers k such that 2^k + 13 is prime.
%C A102634 If k is odd, then 2^k + 13 is divisible by 3. - _Robert G. Wilson v_, Jan 24 2005
%C A102634 a(15) > 5*10^5. - _Robert Price_, Aug 15 2015
%C A102634 For k in this sequence, the number 2^(k-1)*(2^k+13) has deficiency 14, cf. A141550. - _M. F. Hasler_, Jul 18 2016
%H A102634 H. Lifchitz and R. Lifchitz (Editors), <a href="http://www.primenumbers.net/prptop/searchform.php?form=2%5En%2B13">PRP Top Records, of the form 2^n+13</a>.
%H A102634 Lei Zhou, <a href="http://www.bme.emory.edu/~lzhou/prime/">Between 2^n and primes</a> [broken link].
%F A102634 a(n) = 2*A253772(n). - _Elmo R. Oliveira_, Nov 12 2023
%e A102634 2^2+13 = 17 is prime.
%e A102634 2^4+13 = 29 is prime.
%e A102634 2^3+13 = 21 is not prime.
%t A102634 Do[m = n; If[PrimeQ[2^n + 13], Print[n]], {n, 2, 19125, 2}] (* _Robert G. Wilson v_, Jan 24 2005 *)
%o A102634 (PARI) first(m)=my(v=vector(m),r=1);for(i=1,m,while(!isprime(2^r + 13),r++);v[i]=r;r++);v; \\ _Anders Hellström_, Aug 15 2015
%Y A102634 Cf. A019434 (2^k+1), A057732 (2^k+3), A059242 (2^k+5), A057195 (2^k+7), A057196 (2^k+9), A102633 (2^k+11), A102634 (this), A057197 (2^k+15), A057200 (2^k+17), A057221 (2^k+19), A057201 (2^k+21), A057203 (2^k+23).
%K A102634 nonn,hard,more
%O A102634 1,1
%A A102634 _Lei Zhou_, Jan 20 2005
%E A102634 a(10) from _Robert G. Wilson v_, Jan 24 2005
%E A102634 a(11)-a(14) from _Robert Price_, Aug 15 2015