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 A320772 #33 Feb 09 2025 10:26:15 %S A320772 683,499,347,227,139,83,59,67,107,179,283,419,587,787,1019,1283,1579, %T A320772 1907,2267,2659,3083,3539,4027,4547,5099,5683,6299,6947,7627,8339, %U A320772 9083,9859,10667,11507,12379,13283,14219,15187,16187,17219,18283,19379,20507,21667,22859,24083,25339,26627,27947 %N A320772 Prime generating polynomial: a(n) = (4*n - 29)^2 + 58. %C A320772 The polynomial (4*n - 29)^2 + 58 generates 28 distinct primes in succession from n=1 to 28. %H A320772 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (3,-3,1). %F A320772 From _Elmo R. Oliveira_, Feb 08 2025: (Start) %F A320772 G.f.: x*(899*x^2 - 1550*x + 683)/(1-x)^3. %F A320772 E.g.f.: exp(x)*(16*x^2 - 216*x + 899) - 899. %F A320772 a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3) for n > 3. (End) %t A320772 Array[(4# - 29)^2 + 58 &, 50] (* _Amiram Eldar_, Dec 15 2018 *) %Y A320772 Cf. A048988. %K A320772 nonn,easy %O A320772 1,1 %A A320772 _Arashdeep Singh_, Oct 21 2018