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 A272284 #11 Feb 16 2025 08:33:33 %S A272284 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 A272284 26,27,28,29,30,31,32,33,34,36,37,38,39,40,42,43,44,45,46,47,49,50,51, %U A272284 55,56,57,60,64,67,68,69,70,71,72,73,74,76,77,79,80,81 %N A272284 Numbers n such that 43*n^2 - 537*n + 2971 is prime. %C A272284 35 is the smallest number not in this sequence. %H A272284 G. C. Greubel, <a href="/A272284/b272284.txt">Table of n, a(n) for n = 1..10000</a> %H A272284 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Prime-GeneratingPolynomial.html">Prime-Generating Polynomials</a> %e A272284 4 is in this sequence since 43*4^2 - 537*4 + 2971 = 688-2148+2971 = 1511 is prime. %t A272284 Select[Range[0, 100], PrimeQ[43#^2 - 537# + 2971] &] %o A272284 (PARI) lista(nn) = for(n=0, nn, if(ispseudoprime(43*n^2 - 537*n + 2971), print1(n, ", "))); \\ _Altug Alkan_, Apr 24 2016 %Y A272284 Cf. A050268, A050267, A005846, A007641, A007635, A048988, A050265, A050266. %Y A272284 Cf. A271980, A272030, A272074, A272075, A272160, A271144, A272285. %K A272284 nonn %O A272284 1,3 %A A272284 _Robert Price_, Apr 24 2016