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 A350696 #24 Jan 26 2023 20:19:40
%S A350696 1,3,7,15,19,39,7,51,163,15,31,231,103,75,7,195,499,99,127,627,955,
%T A350696 555,691,87,679,99,1411,351,799,135,91,771,79,951,667,975,1183,1311,
%U A350696 667,315,955,759,2011,9315,4243,1575,907,1527,3943,2091,1927,75,1879
%N A350696 a(n) is the least nonnegative integer k such that 2^n + k is a safe prime.
%C A350696 2^n+a(n) is the smallest (n+1)-bit safe prime.
%H A350696 Mark Andreas, <a href="/A350696/b350696.txt">Table of n, a(n) for n = 2..5120</a>
%e A350696 a(6)=19 because 2^6+19=83 is the smallest safe prime greater than 64 of the form p=2q+1 where p and q are both primes.
%t A350696 safeQ[p_] := And @@ PrimeQ[{p, (p - 1)/2}]; a[n_] := Module[{k = 2^n + 1}, While[! safeQ[k], k++]; k -= 2^n]; Array[a, 50, 2] (* _Amiram Eldar_, Jan 12 2022 *)
%o A350696 (PARI) a(n) = {my(k=0); until (isprime(2^n+k) && isprime((2^n+k-1)/2), k++); return (k); }
%Y A350696 Cf. A111671, A057821, A243916, A181356, A335313.
%K A350696 nonn
%O A350696 2,2
%A A350696 _Mark Andreas_, Jan 12 2022