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 A127989 #28 Sep 08 2022 08:45:29
%S A127989 9,21,57,129,249,429,681,1017,1449,1989,2649,3441,4377,5469,6729,8169,
%T A127989 9801,11637,13689,15969,18489,21261,24297,27609,31209,35109,39321,
%U A127989 43857,48729,53949,59529,65481,71817,78549,85689,93249,101241,109677,118569
%N A127989 a(n) = 2*n^3 - 2*n + 9.
%C A127989 All numbers generated by the irreducible polynomial 2*n^3-2*n+9 are composite (indeed, they are multiples of 3). Largest prime factor A127990, smallest prime factor A127991, number of prime factors A127992.
%H A127989 Vincenzo Librandi, <a href="/A127989/b127989.txt">Table of n, a(n) for n = 1..10000</a>
%H A127989 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (4,-6,4,-1).
%F A127989 a(n) = 2*(n-1)*n*(n+1)+9 = 3*(2*A007290(n+1)+3).
%F A127989 G.f.: 3*x*(3-5*x+9*x^2-3*x^3)/(1-x)^4. - _Bruno Berselli_, Sep 09 2011
%F A127989 a(n) = 4*a(n-1)-6*a(n-2)+4*a(n-3)-a(n-4). - _Wesley Ivan Hurt_, Oct 11 2021
%t A127989 Table[2x^3 - 2x + 9, {x, 1, 100}]
%t A127989 LinearRecurrence[{4,-6,4,-1}, {9, 21, 57, 129}, 50] (* _G. C. Greubel_, May 08 2018 *)
%o A127989 (Magma) [2*(n-1)*n*(n+1)+9: n in [1..50]]; // _Vincenzo Librandi_, Sep 13 2011
%o A127989 (PARI) a(n)=2*n^3-2*n+9 \\ _Charles R Greathouse IV_, Sep 30 2015
%Y A127989 Cf. A127990, A127991, A127992. Subsequence of A017629.
%K A127989 nonn,easy
%O A127989 1,1
%A A127989 _Artur Jasinski_, Feb 10 2007