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 A272130 #16 Sep 08 2022 08:46:16
%S A272130 1,31,177,535,1201,2271,3841,6007,8865,12511,17041,22551,29137,36895,
%T A272130 45921,56311,68161,81567,96625,113431,132081,152671,175297,200055,
%U A272130 227041,256351,288081,322327,359185,398751,441121,486391,534657,586015,640561,698391
%N A272130 a(n) = 16*n^3 + 10*n^2 + 4*n + 1.
%H A272130 Vincenzo Librandi, <a href="/A272130/b272130.txt">Table of n, a(n) for n = 0..1000</a>
%H A272130 M. Beck, J. A. De Loera, M. Develin, J. Pfeifle and R. P. Stanley, <a href="http://www-math.mit.edu/~rstan/papers/ehrhart.pdf">Coefficients and roots of Ehrhart Polynomials</a>, Contemp. Math. 374 (2005), 15-36, page 19.
%H A272130 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (4,-6,4,-1).
%F A272130 O.g.f.: (1+27*x+59*x^2+9*x^3)/(1-x)^4.
%F A272130 E.g.f.: (1+30*x+58*x^2+16*x^3)*exp(x).
%F A272130 a(n) = 4*a(n-1)-6*a(n-2)+4*a(n-3)-a(n-4) for n>3.
%F A272130 a(n) = A158187(n) + A144965(n).
%p A272130 A272130:=n->16*n^3+10*n^2+4*n+1: seq(A272130(n), n=0..50); # _Wesley Ivan Hurt_, Apr 22 2016
%t A272130 LinearRecurrence[{4,-6,4,-1},{1,31,177,535},50]
%t A272130 CoefficientList[Series[(1 + 27*x + 59*x^2 + 9*x^3)/(1 - x)^4, {x, 0, 30}], x] (* _Wesley Ivan Hurt_, Apr 22 2016 *)
%o A272130 (Magma) [16*n^3+10*n^2+4*n+1: n in [0..50]];
%o A272130 (PARI) vector(100, n, n--; 16*n^3+10*n^2+4*n+1) \\ _Altug Alkan_, Apr 22 2016
%Y A272130 Cf. A144965, A158187, A272039.
%K A272130 nonn,easy
%O A272130 0,2
%A A272130 _Vincenzo Librandi_, Apr 21 2016