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 A161726 #52 Feb 09 2025 13:31:36
%S A161726 9479,8563,7649,6737,5827,4919,4013,3109,2207,1307,409,-487,-1381,
%T A161726 -2273,-3163,-4051,-4937,-5821,-6703,-7583,-8461,-9337,-10211,-11083,
%U A161726 -11953,-12821,-13687,-14551,-15413,-16273,-17131,-17987,-18841,-19693,-20543,-21391,-22237
%N A161726 a(n) = n^2 - 917*n + 9479.
%C A161726 A prime-generating polynomial of the form f(x) = x^2 - b*x + c.
%C A161726 |a(n)| are distinct primes for 0 <= n <= 29.
%C A161726 The values of this polynomial are never divisible by a prime less than 37. - _Arkadiusz Wesolowski_, Oct 11 2011
%H A161726 Arkadiusz Wesolowski, <a href="/A161726/b161726.txt">Table of n, a(n) for n = 0..1000</a>
%H A161726 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (3,-3,1).
%F A161726 G.f.: (-9479 + 19874*x - 10397*x^2)/(x-1)^3. - _R. J. Mathar_, Mar 08 2011
%F A161726 From _Elmo R. Oliveira_, Feb 09 2025: (Start)
%F A161726 E.g.f.: exp(x)*(9479 - 916*x + x^2).
%F A161726 a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3) for n > 2. (End)
%p A161726 seq(n^2-917*n+9479, n=0..36); # _Arkadiusz Wesolowski_, Mar 08 2011
%t A161726 Table[n^2 - 917*n + 9479, {n, 0, 36}] (* _Arkadiusz Wesolowski_, Mar 04 2011 *)
%o A161726 (Magma) [n^2-917*n+9479 : n in [0..36]]; // _Arkadiusz Wesolowski_, Mar 04 2011
%o A161726 (PARI) for(n=0, 36, print1(n^2-917*n+9479, ", ")); \\ _Arkadiusz Wesolowski_, Mar 02 2011
%Y A161726 Cf. A005846, A007635, A048059.
%K A161726 easy,sign
%O A161726 0,1
%A A161726 _Arkadiusz Wesolowski_, Jun 17 2009
%E A161726 Definition and offset changed by _R. J. Mathar_, Jun 18 2009