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 A101374 #23 Sep 08 2022 08:45:16 %S A101374 0,1,8,39,124,305,636,1183,2024,3249,4960,7271,10308,14209,19124, %T A101374 25215,32656,41633,52344,64999,79820,97041,116908,139679,165624, %U A101374 195025,228176,265383,306964,353249,404580,461311,523808,592449,667624,749735,839196 %N A101374 a(n) = n*(n^3 - n + 2)/2. %D A101374 T. A. Gulliver, Sequences from Cubes of Integers, Int. Math. Journal, 4 (2003), 439-445. %H A101374 Vincenzo Librandi, <a href="/A101374/b101374.txt">Table of n, a(n) for n = 0..1000</a> %H A101374 <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (5,-10,10,-5,1). %F A101374 a(n) = 5*a(n-1) - 10*a(n-2) + 10*a(n-3) - 5*a(n-4) + a(n-5) for n>4. - _Harvey P. Dale_, Sep 28 2012 %e A101374 From _Bruno Berselli_, Oct 30 2017: (Start) %e A101374 After 0: %e A101374 1 = -(0) + (1); %e A101374 8 = -(0 + 1) + (2 + 3 + 2^2); %e A101374 39 = -(0 + 1 + 2) + (3 + 4 + 5 + 6 + 7 + 8 + 3^2); %e A101374 124 = -(0 + 1 + 2 + 3) + (4 + 5 + 6 + 7 + ... + 15 + 4^2); %e A101374 305 = -(0 + 1 + 2 + 3 + 4) + (5 + 6 + 7 + 8 + ... + 24 + 5^2); %e A101374 636 = -(0 + 1 + 2 + 3 + 4 + 5) + (6 + 7 + 8 + 9 + ... + 35 + 6^2), etc. (End) %t A101374 Table[n (n^3 - n + 2)/2, {n, 0, 50}] (* or *) LinearRecurrence[{5, -10, 10, -5, 1}, {0, 1, 8, 39, 124}, 50] (* _Harvey P. Dale_, Sep 28 2012 *) %o A101374 (Magma) [n*(n^3-n+2)/2: n in [0..40]]; // _Vincenzo Librandi_, May 26 2011 %K A101374 nonn,easy %O A101374 0,3 %A A101374 _N. J. A. Sloane_, Jan 15 2005