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 A057662 #16 Mar 13 2025 08:56:06
%S A057662 3,3,5,3,5,17,29,53,11,11,11,29,71,29,5,5,131,197,3,11,29,23,89,29,
%T A057662 359,149,239,239,881,281,29,3449,197,683,389,683,101,1283,83,191,1181,
%U A057662 197,5,71,107,101,71,4001,1433,251,431,29,1361,89,509,83,2459,941,101,197
%N A057662 Smallest prime q such that q + 2^prime(n) is a prime, where prime(n) is the n-th prime.
%H A057662 Amiram Eldar, <a href="/A057662/b057662.txt">Table of n, a(n) for n = 1..500</a>
%F A057662 a(n) = A056206(A000040(n)).
%e A057662 For n = 6, prime(6) = 13, 8192 + 17 = 8209 is a prime but 8192 + 2, 8182 + 3, ..., 8192 + 13 are not, so a(6) = 17.
%t A057662 a[n_] := Module[{m = 2^Prime[n], q = 2}, While[!PrimeQ[q + m], q = NextPrime[q]]; q]; Array[a, 60] (* _Amiram Eldar_, Mar 13 2025 *)
%o A057662 (PARI) a(n) = my(P=2^prime(n), q=2); while (!isprime(P+q), q = nextprime(q+1)); q; \\ _Michel Marcus_, Mar 04 2022
%Y A057662 Cf. A056206, A056208.
%K A057662 nonn
%O A057662 1,1
%A A057662 _Labos Elemer_, Oct 16 2000