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 A264771 #12 Sep 08 2022 08:46:14
%S A264771 2,5,11,29,131,181,233,379,991,1109,1249,1721,2633,2861,3539,4273,
%T A264771 6971,8009,8353,10301,10711,13313,17291,19973,22349,26053,26731,32941,
%U A264771 34369,35129,36671,37441,39799,47269,49033,54521,58321,69431,79241,82609,87257
%N A264771 Primes of the form n^2 + phi(n).
%e A264771 The prime 29 is in sequence because 29 = 5^2 + phi(5).
%t A264771 Select[Table[n^2 + EulerPhi[n], {n, 500}], PrimeQ]
%o A264771 (Magma) [a: n in [1..300] | IsPrime(a) where a is n^2 + EulerPhi(n)];
%o A264771 (PARI) for(n=1, 1e3, if(isprime(k=n^2 + eulerphi(n)), print1(k, ", "))) \\ _Altug Alkan_, Nov 24 2015
%Y A264771 Cf. A000010, A000290, A258435, A264724.
%K A264771 nonn,easy
%O A264771 1,1
%A A264771 _Vincenzo Librandi_, Nov 24 2015