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 A065376 #25 Apr 12 2025 03:50:13
%S A065376 3,7,11,17,19,23,29,41,43,47,53,59,67,71,73,79,83,89,97,101,103,107,
%T A065376 109,113,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,
%U A065376 211,223,227,229,233,239,241,251,257,263,269,271,277,281,283,293,307
%N A065376 Primes of the form p + k^2, p prime and k > 0.
%C A065376 Conjectured to contain all primes > 7549. - _Robert Israel_, Sep 03 2014
%H A065376 Amiram Eldar, <a href="/A065376/b065376.txt">Table of n, a(n) for n = 1..1000</a>
%e A065376 a(3) = 11 = 2 + 3^2 = 7 + 2^2.
%p A065376 N = 1000: # to get all entries <= N
%p A065376 Primes:= select(isprime, {$1..N}):
%p A065376 Primes intersect {seq(seq(p + k^2, p = Primes),k=1..floor(sqrt(N)))}; # _Robert Israel_, Sep 03 2014
%t A065376 q[n_] := AnyTrue[Range[Floor[Sqrt[n]]], PrimeQ[n - #^2] &]; seq[lim_] := Module[{p = Prime[Range[lim]]}, Select[p, q]]; seq[100] (* _Amiram Eldar_, Apr 12 2025 *)
%o A065376 (PARI) lista(nn) = {forprime(p=2, nn, forprime(q=2, p-1, if (issquare(p-q), print1(p, ", "); break;);););} \\ _Michel Marcus_, Sep 03 2014
%Y A065376 Complement of A065377.
%Y A065376 Cf. A000040, A000290.
%K A065376 nonn
%O A065376 1,1
%A A065376 _Reinhard Zumkeller_, Nov 03 2001