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 A180118 #53 Sep 08 2022 08:45:54
%S A180118 0,6,18,38,68,110,166,238,328,438,570,726,908,1118,1358,1630,1936,
%T A180118 2278,2658,3078,3540,4046,4598,5198,5848,6550,7306,8118,8988,9918,
%U A180118 10910,11966,13088,14278,15538,16870,18276,19758,21318,22958,24680,26486,28378,30358
%N A180118 a(n) = Sum_{k=1..n} (k+2)!/k! = Sum_{k=1..n} (k+2)*(k+1).
%C A180118 In general, sequences of the form a(n) = sum((k+x+2)!/(k+x)!,k=1..n) have a closed form a(n) = n*(11+12*x+3*x^2+3*x*n+6*n+n^2)/3.
%C A180118 This sequence is related to A033487 by A033487(n) = n*a(n)-sum(a(i), i=0..n-1). - _Bruno Berselli_, Jan 24 2011
%C A180118 The minimal number of multiplications (using schoolbook method) needed to compute the matrix chain product of a sequence of n+1 matrices having dimensions 1 X 2, 2 X 3, ..., (n+1) X (n+2), respectively. - _Alois P. Heinz_, Jan 27 2017
%H A180118 Vincenzo Librandi, <a href="/A180118/b180118.txt">Table of n, a(n) for n = 0..1000</a>
%H A180118 B. Berselli, A description of the recursive method in Comments lines: website <a href="http://www.lanostra-matematica.org/2008/12/sequenze-numeriche-e-procedimenti.html">Matem@ticamente</a> (in Italian).
%H A180118 Wikipedia, <a href="https://en.wikipedia.org/wiki/Matrix_chain_multiplication">Matrix chain multiplication</a>
%H A180118 Wikipedia, <a href="https://en.wikipedia.org/wiki/Matrix_multiplication_algorithm#Iterative_algorithm">Schoolbook matrix multiplication</a>
%H A180118 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (4,-6,4,-1).
%F A180118 a(n) = +4*a(n-1)-6*a(n-2)+4*a(n-3)-1*a(n-4) for n>=4.
%F A180118 a(n) = n*(n^2+6*n+11)/3.
%F A180118 From _Bruno Berselli_, Jan 24 2011: (Start)
%F A180118 G.f.: 2*x*(3-3*x+x^2)/(1-x)^4. [corrected by _Georg Fischer_, May 10 2019]
%F A180118 Sum(a(k), k=0..n) = 2*A005718(n) for n>0. (End)
%t A180118 f[n_]:=n*(n^2 + 6 n + 11)/3; f[Range[0,60]] (* _Vladimir Joseph Stephan Orlovsky_, Feb 10 2011*)
%t A180118 CoefficientList[Series[2*x*(3 - 3*x + x^2)/(1 - x)^4, {x, 0, 50}], x] (* _Vaclav Kotesovec_, May 10 2019 *)
%t A180118 Table[Sum[(k+1)(k+2),{k,n}],{n,0,50}] (* or *) LinearRecurrence[{4,-6,4,-1},{0,6,18,38},50] (* _Harvey P. Dale_, Apr 21 2020 *)
%o A180118 (Magma) [n*(n^2+6*n+11)/3: n in [0..45]]; // _Vincenzo Librandi_, Jun 15 2011
%Y A180118 Cf. A005718, A033487, A050534.
%K A180118 nonn,easy
%O A180118 0,2
%A A180118 _Gary Detlefs_, Aug 10 2010