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 A083374 #94 Sep 08 2022 08:45:10
%S A083374 0,6,36,120,300,630,1176,2016,3240,4950,7260,10296,14196,19110,25200,
%T A083374 32640,41616,52326,64980,79800,97020,116886,139656,165600,195000,
%U A083374 228150,265356,306936,353220,404550,461280,523776,592416,667590,749700,839160,936396
%N A083374 a(n) = n^2 * (n^2 - 1)/2.
%C A083374 Triangular numbers t_n as n runs through the squares.
%C A083374 Partial sums of A055112: If one generated Pythagorean primitive triangles from n, n+1, then the collective areas of n of them would be equal to the numbers in this sequence. The sum of the first three triangles is 6+30+84 = 120 which is the third nonzero term of the sequence. - _J. M. Bergot_, Jul 14 2011
%C A083374 Second leg of Pythagorean triangles with smallest side a cube: A000578(n)^2 + a(n)^2 = A037270(n)^2. - _Martin Renner_, Nov 12 2011
%C A083374 a(n) is the number of segments on an n X n grid or geoboard. - _Martin Renner_, Apr 17 2014
%C A083374 Consider the partitions of 2n into two parts (p,q). Then a(n) is the total volume of the family of rectangular prisms with dimensions p, q and |q-p|. - _Wesley Ivan Hurt_, Apr 15 2018
%D A083374 Albert H. Beiler, Recreations in the theory of numbers, New York: Dover, (2nd ed.) 1966, p. 106, table 55.
%H A083374 Vincenzo Librandi, <a href="/A083374/b083374.txt">Table of n, a(n) for n = 1..10000</a>
%H A083374 Somaya Barati, Beáta Bényi, Abbas Jafarzadeh and Daniel Yaqubi, <a href="https://arxiv.org/abs/1812.02955">Mixed restricted Stirling numbers</a>, arXiv:1812.02955 [math.CO], 2018.
%H A083374 Franck Ramaharo, <a href="https://arxiv.org/abs/1805.10680">A generating polynomial for the pretzel knot</a>, arXiv:1805.10680 [math.CO], 2018.
%H A083374 <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (5,-10,10,-5,1).
%F A083374 a(n) = (n + 1) * A006002(n).
%F A083374 a(n) = A047928(n)/2 = A002415(n+1)*6 = A006011(n+1)*2 = A008911(n+1)*3. - _Zerinvary Lajos_, May 09 2007
%F A083374 a(n) = binomial(n^2,2), n>=1. - _Zerinvary Lajos_, Jan 07 2008
%F A083374 a(n) = 5*a(n-1)-10*a(n-2)+10*a(n-3)-5*a(n-4)+a(n-5) for n>5. - _R. J. Mathar_, Apr 10 2009
%F A083374 G.f.: -6*x^2*(1+x)/(x-1)^5. - _R. J. Mathar_, Apr 10 2009
%F A083374 Sum_{n>1} 1/a(n) = (21 - 2*Pi^2)/6. - _Enrique Pérez Herrero_, Apr 01 2013
%F A083374 a(n) = Sum_{k=0..n-1} k*A000217(2*k+1). - _Bruno Berselli_, Sep 04 2013
%F A083374 a(n) = 2*A000217(n-1)*A000217(n). - _Gionata Neri_, May 04 2015
%F A083374 a(n) = Sum_{i=1..n^2-1} i. - _Wesley Ivan Hurt_, Nov 24 2015
%F A083374 E.g.f.: exp(x)*x^2*(6 + 6*x + x^2)/2. - _Stefano Spezia_, Jun 06 2021
%F A083374 Sum_{n>=2} (-1)^n/a(n) = Pi^2/6 - 3/2. - _Amiram Eldar_, Nov 02 2021
%p A083374 A083374 := proc(n) n^2*(n^2-1)/2 ; end proc: # _R. J. Mathar_, Aug 23 2011
%t A083374 Table[n^2*(n^2-1)/2, {n,40}] (* _T. D. Noe_, Oct 25 2006 *)
%o A083374 (PARI) a(n)=binomial(n^2,2) \\ _Charles R Greathouse IV_, Aug 23 2011
%o A083374 (Magma) [n^2*(n^2-1)/2: n in [1..40]]; // _Vincenzo Librandi_, Sep 14 2011
%o A083374 (Magma) A000217:=func<i | i*(i+1)/2>; [&+[k*A000217(2*k+1): k in [0..n-1]]: n in [1..40]]; // _Bruno Berselli_, Sep 04 2013
%Y A083374 Cf. A000217, A000578, A002415, A006002, A006011, A008911, A037270, A047928, A055112.
%K A083374 easy,nonn
%O A083374 1,2
%A A083374 Alan Sutcliffe (alansut(AT)ntlworld.com), Jun 05 2003
%E A083374 Corrected and extended by _T. D. Noe_, Oct 25 2006