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 A061119 #20 Feb 18 2025 17:38:53
%S A061119 3,17,593,32993,2097593,8589935681
%N A061119 Primes in the sequence n^2 + 2^n (A001580).
%C A061119 p and p^2 + 2^p are both prime only for p=3. All positive n satisfy the congruence n=3 (mod 6). - _Lekraj Beedassy_, Sep 07 2004
%C A061119 For values of n, see A064539. - _Lekraj Beedassy_, Jan 01 2007
%C A061119 The next term has 605 digits. - _Harvey P. Dale_, Jul 19 2017
%D A061119 J.-M. De Koninck & A. Mercier, 1001 Problemes en Theorie Classique Des Nombres, Problem 165 pp. 30; 160, Ellipses Paris 2004.
%F A061119 a(n) = A001580(A064539(n)). - _Elmo R. Oliveira_, Feb 18 2025
%e A061119 a(3) = 593 = 2^9 + 9^2.
%e A061119 a(4) = 32993 = 2^15 + 15^2.
%t A061119 Select[Table[n^2+2^n,{n,1000}],PrimeQ] (* _Harvey P. Dale_, Jul 19 2017 *)
%o A061119 (PARI) for(n=1,10^7, if(isprime(n^2+2^n),print(n^2+2^n)))
%Y A061119 Subsequence of A094133.
%Y A061119 Cf. A001580, A064539, A075896.
%K A061119 nonn
%O A061119 1,1
%A A061119 _Amarnath Murthy_, Apr 21 2001
%E A061119 More terms from _Jason Earls_, Aug 09 2001. Next term too large to include.