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 A272813 #16 Feb 16 2025 08:33:34 %S A272813 0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25, %T A272813 26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48, %U A272813 49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66 %N A272813 Nonnegative numbers n such that n^2 - 79n + 1601 is prime. %C A272813 80 is the smallest number not in this sequence. %C A272813 See A005846 for the corresponding primes. %H A272813 Robert Price, <a href="/A272813/b272813.txt">Table of n, a(n) for n = 1..4179</a> %H A272813 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Prime-GeneratingPolynomial.html">Prime-Generating Polynomials</a> %e A272813 4 is in this sequence since 4^2 - 79*4 + 1601 = 16-316+1601 = 1301 is prime. %t A272813 Select[Range[0, 100], PrimeQ[#^2 - 79# + 1601 ] &] %o A272813 (PARI) lista(nn) = for(n=0, nn, if(isprime(n^2-79*n+1601), print1(n, ", "))); \\ _Altug Alkan_, May 06 2016 %Y A272813 Cf. A050268, A050267, A005846, A007641, A007635, A048988, A050265, A050266. %Y A272813 Cf. A271980, A272030, A272074, A272075, A272160, A271144, A272285, A272401, A272438, A272444, A272410, A272555, A272710, A005846. %K A272813 nonn %O A272813 1,3 %A A272813 _Robert Price_, May 06 2016