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 A131464 #32 Dec 06 2024 16:30:07
%S A131464 2,23,86,215,434,767,1238,1871,2690,3719,4982,6503,8306,10415,12854,
%T A131464 15647,18818,22391,26390,30839,35762,41183,47126,53615,60674,68327,
%U A131464 76598,85511,95090,105359,116342,128063,140546,153815,167894,182807,198578,215231,232790
%N A131464 a(n) = 4*n^3 - 3*n^2 + 2*n - 1.
%H A131464 Vincenzo Librandi, <a href="/A131464/b131464.txt">Table of n, a(n) for n = 1..1000</a>
%H A131464 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (4,-6,4,-1).
%F A131464 From _Vincenzo Librandi_, Feb 12 2013: (Start)
%F A131464 G.f.: x*(2 + 15*x + 6*x^2 + x^3)/(1 - x)^4.
%F A131464 a(n) = 4*a(n-1)-6*a(n-2)+4*a(n-3)-a(n-4). (End)
%F A131464 E.g.f.: 1 - exp(x)*(1 - 3*x - 9*x^2 - 4*x^3). - _Stefano Spezia_, Dec 06 2024
%t A131464 CoefficientList[Series[(2 + 15 x + 6 x^2 + x^3)/(1 - x)^4, {x, 0, 40}], x] (* _Vincenzo Librandi_, Feb 12 2013 *)
%t A131464 Table[4n^3-3n^2+2n-1,{n,40}] (* or *) LinearRecurrence[{4,-6,4,-1},{2,23,86,215},40] (* _Harvey P. Dale_, May 05 2018 *)
%o A131464 (Magma) [4*n^3-3*n^2+2*n-1: n in [1..40]]; // _Vincenzo Librandi_, Feb 12 2013
%o A131464 (Magma) I:=[2, 23, 86, 215]; [n le 4 select I[n] else 4*Self(n-1)-6*Self(n-2)+4*Self(n-3)-Self(n-4): n in [1..40]]; // _Vincenzo Librandi_, Feb 12 2013
%Y A131464 Cf. A084849, A056109, A056105, A056578.
%K A131464 nonn,easy
%O A131464 1,1
%A A131464 _Mohammad K. Azarian_, Jul 26 2007