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 A168297 #16 Oct 18 2022 15:26:14
%S A168297 1,1,9,31,73,141,241,379,561,793,1081,1431,1849,2341,2913,3571,4321,
%T A168297 5169,6121,7183,8361,9661,11089,12651,14353,16201,18201,20359,22681,
%U A168297 25173,27841,30691,33729,36961,40393,44031,47881,51949,56241,60763,65521
%N A168297 a(n) = n^3 + (1-n)^2.
%H A168297 G. C. Greubel, <a href="/A168297/b168297.txt">Table of n, a(n) for n = 0..1000</a>
%H A168297 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (4, -6, 4, -1).
%F A168297 G.f.: (1 - 3*x + 11*x^2 - 3*x^3)/(1-x)^4. - _R. J. Mathar_, Nov 24 2009
%F A168297 a(n) = 4*a(n-1) - 6*a(n-2) + 4*a(n-3) - a(n-4). - _G. C. Greubel_, Jul 17 2016
%t A168297 Table[n^3 + (1 - n)^2, {n, 0, 50}] (* or *) LinearRecurrence[{4,-6,4,-1}, {1, 1, 9, 31}, 50] (* _G. C. Greubel_, Jul 17 2016 *)
%o A168297 (Magma) [n^3+(1-n)^2: n in [0..40]]; // _Vincenzo Librandi_, Jul 18 2016
%o A168297 (PARI) a(n)=n^3+(n-1)^2 \\ _Charles R Greathouse IV_, Oct 18 2022
%Y A168297 Cf. A153257.
%K A168297 nonn,easy
%O A168297 0,3
%A A168297 _Vladimir Joseph Stephan Orlovsky_, Nov 22 2009
%E A168297 Flipped/normalized the sign of n - _R. J. Mathar_, Nov 24 2009
%E A168297 Further edited by _N. J. A. Sloane_, Nov 24 2009