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 A253776 #13 Sep 18 2024 02:51:25
%S A253776 13,71,137,251,353,523,1013,1033,2213,4933,24421,32803,39341,59063,
%T A253776 78137,117701,125053,140663,148933,205441,274693,279949,343073,371311,
%U A253776 456613,493121,524309,571873,681563,912773,1225153,1594339,1953253,2406241,2924353,3241943,3652421
%N A253776 Primes representable as x^y + x + y, where x>1, y>1 are integers.
%H A253776 Robert Israel and Charles R Greathouse IV, <a href="/A253776/b253776.txt">Table of n, a(n) for n = 1..10000</a> (first 800 terms from Israel)
%p A253776 N:= 10^6; # to get all terms <= N
%p A253776 A:= select(t -> t <= N and isprime(t), {seq(seq(x^y+x+y, y = 2..floor(log[x](N-x))), x=2..floor(sqrt(N)))}, N):
%p A253776 sort(convert(A,list)); # _Robert Israel_, Sep 18 2024
%o A253776 (PARI) list(lim)=my(v=List()); forstep(y=3,oo,2, if(2^y+y+2>lim, break); for(x=2,oo, my(p=x^y+x+y); if(p>lim, break); if(isprime(p), listput(v,p)))); Set(v) \\ _Charles R Greathouse IV_, Sep 18 2024
%Y A253776 Cf. A253775, A253777.
%K A253776 nonn
%O A253776 1,1
%A A253776 _Alex Ratushnyak_, Jan 12 2015