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 A067389 #22 Sep 08 2022 08:45:05
%S A067389 0,6,34,102,228,430,726,1134,1672,2358,3210,4246,5484,6942,8638,10590,
%T A067389 12816,15334,18162,21318,24820,28686,32934,37582,42648,48150,54106,
%U A067389 60534,67452,74878,82830,91326,100384,110022,120258,131110,142596
%N A067389 a(n) = 3*n^3 + 2*n^2 + n.
%H A067389 Vincenzo Librandi, <a href="/A067389/b067389.txt">Table of n, a(n) for n = 0..1000</a>
%H A067389 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (4,-6,4,-1).
%F A067389 a(n) = n*A056109(n) = A045991(n+1)+A033431(n). - _Henry Bottomley_, Jan 25 2002
%F A067389 From _Chai Wah Wu_, Apr 25 2017: (Start)
%F A067389 a(n) = 4*a(n-1) - 6*a(n-2) + 4*a(n-3) - a(n-4) for n > 3.
%F A067389 G.f.: 2*x*(x^2 + 5*x + 3)/(x - 1)^4. (End)
%p A067389 a:=n->n+2*n^2+3*n^3: seq(a(n), n=0..36); # _Zerinvary Lajos_, Oct 05 2007
%t A067389 Table[3*n^3+2*n^2+n,{n,0,80}] (* _Vladimir Joseph Stephan Orlovsky_, May 07 2011 *)
%t A067389 LinearRecurrence[{4,-6,4,-1},{0,6,34,102},40] (* _Harvey P. Dale_, Oct 01 2019 *)
%o A067389 (Magma) [3*n^3 + 2*n^2 + n: n in [0..60]]; // _Vincenzo Librandi_, May 08 2011
%K A067389 nonn,easy
%O A067389 0,2
%A A067389 _George E. Antoniou_, Jan 21 2002
%E A067389 More terms from _Henry Bottomley_, Jan 25 2002