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 A211607 #36 Feb 16 2025 08:33:17
%S A211607 10753,7741,4951,2383,37,-2087,-3989,-5669,-7127,-8363,-9377,-10169,
%T A211607 -10739,-11087,-11213,-11117,-10799,-10259,-9497,-8513,-7307,-5879,
%U A211607 -4229,-2357,-263,2053,4591,7351,10333,13537,16963,20611,24481,28573,32887,37423,42181,47161,52363,57787
%N A211607 a(n) = 111*n^2 - 3123*n + 10753.
%D A211607 A prime-generating quadratic: the absolute values are primes for 0 <= n <= 39.
%H A211607 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Prime-GeneratingPolynomial.html">Prime-Generating Polynomial</a>.
%H A211607 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (3,-3,1).
%F A211607 a(n) = 111*n^2 - 3123*n + 10753.
%F A211607 G.f.: -(13987*x^2-24518*x+10753)/(x-1)^3. - _Colin Barker_, Feb 16 2013
%F A211607 From _Elmo R. Oliveira_, Oct 31 2024: (Start)
%F A211607 E.g.f.: exp(x)*(10753 - 3012*x + 111*x^2).
%F A211607 a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3) for n > 2. (End)
%p A211607 proc(i)
%p A211607 local a, n;
%p A211607 for n from 0 to i do a:=111*n^2-3123*n+10753; if isprime(abs(a)) then
%p A211607 print(a); fi; od; end:
%t A211607 Table[111n^2 - 3123n + 10753, {n, 0, 39}] (* _Alonso del Arte_, Feb 13 2013 *)
%t A211607 LinearRecurrence[{3,-3,1},{10753,7741,4951},40] (* _Harvey P. Dale_, Dec 04 2015 *)
%o A211607 (PARI) a(n)=111*n^2-3123*n+10753 \\ _Charles R Greathouse IV_, Feb 12 2013
%Y A211607 Cf. A005846, A050268, A128878, A217439, A217440.
%K A211607 sign,easy
%O A211607 0,1
%A A211607 _Yusuf Z Gurtas_, Feb 10 2013