A059860 -id:A059860 - cp's OEIS frontend

A000537 Sum of first n cubes; or n-th triangular number squared.

0, 1, 9, 36, 100, 225, 441, 784, 1296, 2025, 3025, 4356, 6084, 8281, 11025, 14400, 18496, 23409, 29241, 36100, 44100, 53361, 64009, 76176, 90000, 105625, 123201, 142884, 164836, 189225, 216225, 246016, 278784, 314721, 354025, 396900, 443556, 494209, 549081

Offset: 0

N. J. A. Sloane

Number of parallelograms in an n X n rhombus. - Matti De Craene (Matti.DeCraene(AT)rug.ac.be), May 14 2000
Or, number of orthogonal rectangles in an n X n checkerboard, or rectangles in an n X n array of squares. - Jud McCranie, Feb 28 2003. Compare A085582.
Also number of 2-dimensional cage assemblies (cf. A059827, A059860).
The n-th triangular number T(n) = Sum_{r=1..n} r = n(n+1)/2 satisfies the relations: (i) T(n) + T(n-1) = n^2 and (ii) T(n) - T(n-1) = n by definition, so that n^2*n = n^3 = {T(n)}^2 - {T(n-1)}^2 and by summing on n we have Sum_{ r = 1..n } r^3 = {T(n)}^2 = (1+2+3+...+n)^2 = (n*(n+1)/2)^2. - Lekraj Beedassy, May 14 2004
Number of 4-tuples of integers from {0,1,...,n}, without repetition, whose last component is strictly bigger than the others. Number of 4-tuples of integers from {1,...,n}, with repetition, whose last component is greater than or equal to the others.
Number of ordered pairs of two-element subsets of {0,1,...,n} without repetition.
Number of ordered pairs of 2-element multisubsets of {1,...,n} with repetition.
1^3 + 2^3 + 3^3 + ... + n^3 = (1 + 2 + 3 + ... + n)^2.
a(n) is the number of parameters needed in general to know the Riemannian metric g of an n-dimensional Riemannian manifold (M,g), by knowing all its second derivatives; even though to know the curvature tensor R requires (due to symmetries) (n^2)*(n^2-1)/12 parameters, a smaller number (and a 4-dimensional pyramidal number). - Jonathan Vos Post, May 05 2006
Also number of hexagons with vertices in an hexagonal grid with n points in each side. - Ignacio Larrosa Cañestro, Oct 15 2006
Number of permutations of n distinct letters (ABCD...) each of which appears twice with 4 and n-4 fixed points. - Zerinvary Lajos, Nov 09 2006
With offset 1 = binomial transform of [1, 8, 19, 18, 6, ...]. - Gary W. Adamson, Dec 03 2008
The sequence is related to A000330 by a(n) = n*A000330(n) - Sum_{i=0..n-1} A000330(i): this is the case d=1 in the identity n*(n*(d*n-d+2)/2) - Sum_{i=0..n-1} i*(d*i-d+2)/2 = n*(n+1)*(2*d*n-2*d+3)/6. - Bruno Berselli, Apr 26 2010, Mar 01 2012
From Wolfdieter Lang, Jan 11 2013: (Start)
For sums of powers of positive integers S(k,n) := Sum_{j=1..n}j^k one has the recurrence S(k,n) = (n+1)*S(k-1,n) - Sum_{l=1..n} S(k-1,l), n >= 1, k >= 1.
This was used for k=4 by Ibn al-Haytham in an attempt to compute the volume of the interior of a paraboloid. See the Strick reference where the trick he used is shown, and the W. Lang link.
This trick generalizes immediately to arbitrary powers k. For k=3: a(n) = (n+1)*A000330(n) - Sum_{l=1..n} A000330(l), which coincides with the formula given in the previous comment by Berselli. (End)
Regarding to the previous contribution, see also Matem@ticamente in Links field and comments on this recurrences in similar sequences (partial sums of n-th powers). - Bruno Berselli, Jun 24 2013
A rectangular prism with sides A000217(n), A000217(n+1), and A000217(n+2) has surface area 6*a(n+1). - J. M. Bergot, Aug 07 2013, edited with corrected indices by Antti Karttunen, Aug 09 2013
A formula for the r-th successive summation of k^3, for k = 1 to n, is (6*n^2+r*(6*n+r-1)*(n+r)!)/((r+3)!*(n-1)!), (H. W. Gould). - Gary Detlefs, Jan 02 2014
Note that this sequence and its formula were known to (and possibly discovered by) Nicomachus, predating Ibn al-Haytham by 800 years. - Charles R Greathouse IV, Apr 23 2014
a(n) is the number of ways to paint the sides of a nonsquare rectangle using at most n colors. Cf. A039623. - Geoffrey Critzer, Jun 18 2014
For n > 0: A256188(a(n)) = A000217(n) and A256188(m) != A000217(n) for m < a(n), i.e., positions of first occurrences of triangular numbers in A256188. - Reinhard Zumkeller, Mar 26 2015
There is no cube in this sequence except 0 and 1. - Altug Alkan, Jul 02 2016
Also the number of chordless cycles in the complete bipartite graph K_{n+1,n+1}. - Eric W. Weisstein, Jan 02 2018
a(n) is the sum of the elements in the multiplication table [0..n] X [0..n]. - Michel Marcus, May 06 2021

			G.f. = x + 9*x^2 + 36*x^3 + 100*x^4 + 225*x^5 + 441*x^6 + ... - _Michael Somos_, Aug 29 2022

M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 813.
Avner Ash and Robert Gross, Summing it up, Princeton University Press, 2016, p. 62, eq. (6.3) for k=3.
A. T. Benjamin and J. J. Quinn, Proofs that really count: the art of combinatorial proof, M.A.A. 2003, p. 110ff.
L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 155.
John H. Conway and R. K. Guy, The Book of Numbers, Copernicus Press, pp. 36, 58.
Clifford Pickover, "Wonders of Numbers, Adventures in Mathematics, Mind and Meaning," Oxford University Press, 2001, p. 325.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
H. K. Strick, Geschichten aus der Mathematik II, Spektrum Spezial 3/11, p. 13.
D. Wells, You Are A Mathematician, "Counting rectangles in a rectangle", Problem 8H, pp. 240; 254, Penguin Books 1995.

T. D. Noe, Table of n, a(n) for n = 0..1000
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].
Luciano Ancora, Sum of cubes of the first "n" natural numbers
Luciano Ancora, The Square Pyramidal Number and other figurate numbers
M. Azaola and F. Santos, The number of triangulations of the cyclic polytope C(n,n-4), Discrete Comput. Geom., 27 (2002), 29-48 (see Prop. 4.2(b)).
Marcel Berger, Encounter with a Geometer, Part II, Notices of the American Mathematical Society, Vol. 47, No. 3, (March 2000), pp. 326-340. [About the work of Mikhael Gromov.]
Bruno Berselli, A description of the recursive method in Comments lines: website Matem@ticamente (in Italian).
blackpenredpen, Math for fun, how many rectangles?, Youtube video (2018).
Bikash Chakraborty, Proof Without Words: Sums of Powers of Natural numbers, arXiv:2012.11539 [math.HO], 2020.
Robert Dawson, On Some Sequences Related to Sums of Powers, J. Int. Seq., Vol. 21 (2018), Article 18.7.6.
Shel Kaphan, How to see that the difference between two successive squared triangular numbers is a cube
Sameen Ahmed Khan, Sums of the powers of reciprocals of polygonal numbers, Int'l J. of Appl. Math. (2020) Vol. 33, No. 2, 265-282.
Seon-Hong Kim and Kenneth B. Stolarsky, Translations and Extensions of the Nicomachean Identity, J. Int. Seq. (2024), Vol. 27, Issue 6, Art. No. 24.6.3. See p. 1.
Wolfdieter Lang, Ibn al-Haytham's trick.
S. Legendre, The Number of Crossings in a Regular Drawing of the Complete Bipartite Graph, JIS 12 (2009) 09.5.5.
Feihu Liu, Guoce Xin, and Chen Zhang, Ehrhart Polynomials of Order Polytopes: Interpreting Combinatorial Sequences on the OEIS, arXiv:2412.18744 [math.CO], 2024. See p. 13.
Henri Picciotto, Sum of Cubes, Proof without words.
C. A. Pickover, "Wonders of Numbers, Adventures in Mathematics, Mind and Meaning," Zentralblatt review
C. J. Pita Ruiz V., Some Number Arrays Related to Pascal and Lucas Triangles, J. Int. Seq. 16 (2013) #13.5.7.
Simon Plouffe, Approximations de séries génératrices et quelques conjectures, Dissertation, Université du Québec à Montréal, 1992.
Simon Plouffe, 1031 Generating Functions, Appendix to Thesis, Montreal, 1992
Eric Weisstein's World of Mathematics, Chordless Cycle
Eric Weisstein's World of Mathematics, Complete Bipartite Graph
Eric Weisstein's World of Mathematics, Faulhaber's Formula
Wikipedia, Faulhaber's formula
Wikipedia, Squared triangular number
G. Xiao, Sigma Server, Operate on "n^3"
Index entries for linear recurrences with constant coefficients, signature (5,-10,10,-5,1).

Convolution of A000217 and A008458.
Cf. A000330, A000538, A006003.
Row sums of triangles A094414 and A094415.
Second column of triangle A008459.
Row 3 of array A103438.
Cf. A000578, A002415, A024166, A101102, A101094, A101097.
Cf. A236770 (see crossrefs).
Cf. A000290, A253169, A256188.
Cf. A000217, A000292, A000332, A000566, A035287, A039623, A053382, A053383, A059376, A059827, A059860, A085582, A127777, A176271.

List([0..40],n->(n*(n+1)/2)^2); # Muniru A Asiru, Dec 05 2018

a000537 = a000290 . a000217  -- Reinhard Zumkeller, Mar 26 2015

[(n*(n+1)/2)^2: n in [0..50]]; // Wesley Ivan Hurt, Jun 06 2014

a:= n-> (n*(n+1)/2)^2:
seq(a(n), n=0..40);

Accumulate[Range[0, 50]^3] (* Harvey P. Dale, Mar 01 2011 *)
f[n_] := n^2 (n + 1)^2/4; Array[f, 39, 0] (* Robert G. Wilson v, Nov 16 2012 *)
Table[CycleIndex[{{1, 2, 3, 4}, {3, 2, 1, 4}, {1, 4, 3, 2}, {3, 4, 1, 2}}, s] /. Table[s[i] -> n, {i, 1, 2}], {n, 0, 30}] (* Geoffrey Critzer, Jun 18 2014 *)
Accumulate @ Range[0, 50]^2 (* Waldemar Puszkarz, Jan 24 2015 *)
Binomial[Range[20], 2]^2 (* Eric W. Weisstein, Jan 02 2018 *)
LinearRecurrence[{5, -10, 10, -5, 1}, {0, 1, 9, 36, 100}, 20] (* Eric W. Weisstein, Jan 02 2018 *)
CoefficientList[Series[-((x (1 + 4 x + x^2))/(-1 + x)^5), {x, 0, 20}], x] (* Eric W. Weisstein, Jan 02 2018 *)

PARI
```
a(n)=(n*(n+1)/2)^2
```

def A000537(n): return (n*(n+1)>>1)**2 # Chai Wah Wu, Oct 20 2023

a(n) = (n*(n+1)/2)^2 = A000217(n)^2 = Sum_{k=1..n} A000578(k), that is, 1^3 + 2^3 + 3^3 + ... + n^3 = (1 + 2 + 3 + ... + n)^2.
G.f.: (x+4*x^2+x^3)/(1-x)^5. - Simon Plouffe in his 1992 dissertation
a(n) = Sum ( Sum ( 1 + Sum (6*n) ) ), rephrasing the formula in A000578. - Xavier Acloque, Jan 21 2003
a(n) = Sum_{i=1..n} Sum_{j=1..n} i*j, row sums of A127777. - Alexander Adamchuk, Oct 24 2004
a(n) = A035287(n)/4. - Zerinvary Lajos, May 09 2007
This sequence could be obtained from the general formula n*(n+1)*(n+2)*(n+3)*...*(n+k)*(n*(n+k) + (k-1)*k/6)/((k+3)!/6) at k=1. - Alexander R. Povolotsky, May 17 2008
G.f.: x*F(3,3;1;x). - Paul Barry, Sep 18 2008
Sum_{k > 0} 1/a(k) = (4/3)*(Pi^2-9). - Jaume Oliver Lafont, Sep 20 2009
a(n) = Sum_{1 <= k <= m <= n} A176271(m,k). - Reinhard Zumkeller, Apr 13 2010
a(n) = Sum_{i=1..n} J_3(i)*floor(n/i), where J_ 3 is A059376. - Enrique Pérez Herrero, Feb 26 2012
a(n) = Sum_{i=1..n} Sum_{j=1..n} Sum_{k=1..n} min(i,j,k). - Enrique Pérez Herrero, Feb 26 2013 [corrected by Ridouane Oudra, Mar 05 2025]
a(n) = 6*C(n+2,4) + C(n+1,2) = 6*A000332(n+2) + A000217(n), (Knuth). - Gary Detlefs, Jan 02 2014
a(n) = -Sum_{j=1..3} j*Stirling1(n+1,n+1-j)*Stirling2(n+3-j,n). - Mircea Merca, Jan 25 2014
Sum_{n>=1} (-1)^(n+1)/a(n) = 4*(3-4*log(2)). - Vaclav Kotesovec, Feb 13 2015
a(n)*((s-2)*(s-3)/2) = P(3, P(s, n+1)) - P(s, P(3, n+1)), where P(s, m) = ((s-2)*m^2-(s-4)*m)/2 is the m-th s-gonal number. For s=7, 10*a(n) = A000217(A000566(n+1)) - A000566(A000217(n+1)). - Bruno Berselli, Aug 04 2015
From Ilya Gutkovskiy, Jul 03 2016: (Start)
E.g.f.: x*(4 + 14*x + 8*x^2 + x^3)*exp(x)/4.
Dirichlet g.f.: (zeta(s-4) + 2*zeta(s-3) + zeta(s-2))/4. (End)
a(n) = (Bernoulli(4, n+1) - Bernoulli(4, 1))/4, n >= 0, with the Bernoulli polynomial B(4, x) from row n=4 of A053382/A053383. See, e.g., the Ash-Gross reference, p. 62, eq. (6.3) for k=3. - Wolfdieter Lang, Mar 12 2017
a(n) = A000217((n+1)^2) - A000217(n+1)^2. - Bruno Berselli, Aug 31 2017
a(n) = n*binomial(n+2, 3) + binomial(n+2, 4) + binomial(n+1, 4). - Tony Foster III, Nov 14 2017
Another identity: ..., a(3) = (1/2)*(1*(2+4+6)+3*(4+6)+5*6) = 36, a(4) = (1/2)*(1*(2+4+6+8)+3*(4+6+8)+5*(6+8)+7*(8)) = 100, a(5) = (1/2)*(1*(2+4+6+8+10)+3*(4+6+8+10)+5*(6+8+10)+7*(8+10)+9*(10)) = 225, ... - J. M. Bergot, Aug 27 2022
Comment from Michael Somos, Aug 28 2022: (Start)
The previous comment expresses a(n) as the sum of all of the n X n multiplication table array entries.
For example, for n = 4:
     1  2  3  4
     2  4  6  8
     3  6  9 12
     4  8 12 16
This array sum can be split up as follows:
   +---+---------------+
   | 0 | 1   2   3   4 |    (0+1)*(1+2+3+4)
   |   +---+-----------+
   | 0 | 2 | 4   6   8 |    (1+2)*(2+3+4)
   |   |   +---+-------+
   | 0 | 3 | 6 | 9  12 |    (2+3)*(3+4)
   |   |   |   +---+---+
   | 0 | 4 | 8 |12 |16 |    (3+4)*(4)
   +---+---+---+---+---+
This kind of row+column sums was used by Ramanujan and others for summing Lambert series. (End)
a(n) = 6*A000332(n+4) - 12*A000292(n+1) + 7*A000217(n+1) - n - 1. - Adam Mohamed, Sep 05 2024

Edited by M. F. Hasler, May 02 2015

A059977 a(n) = binomial(n+2, 2)^4.

Original entry on oeis.org

1, 81, 1296, 10000, 50625, 194481, 614656, 1679616, 4100625, 9150625, 18974736, 37015056, 68574961, 121550625, 207360000, 342102016, 547981281, 855036081, 1303210000, 1944810000, 2847396321, 4097152081, 5802782976, 8100000000, 11156640625, 15178486401

Offset: 0

Robert G. Wilson v, Mar 06 2001

nonn

Number of 4-dimensional cage assemblies.

See Chap. 61, "Hyperspace Prisons", of C. Pickover's book "Wonders of Numbers" for full explanation of "cage numbers."

			1 = (1 + 1)/2, 81 = (33 + 129)/2, 1296 = (276 + 2316)/2, 10000 = (1300 + 18700)/2, ... - _Philippe Deléham_, May 25 2015

Clifford A. Pickover, "Wonders of Numbers, Adventures in Mathematics, Mind and Meaning," Oxford University Press, 2001, p. 325.

Harry J. Smith, Table of n, a(n) for n = 0..1000
Clifford A. Pickover, "Wonders of Numbers, Adventures in Mathematics, Mind and Meaning," Zentralblatt review.
Index entries for linear recurrences with constant coefficients, signature (9,-36,84,-126,126,-84,36,-9,1).

Cf. A000217, A000539, A000541, A059827, A059860.

Cf. A168364 (first differences).

with (combinat):seq(mul(stirling2(n+1,n),k=1..4),n=1..24); # Zerinvary Lajos, Dec 16 2007

m = 4; Table[ ( (n^m)(n + 1)^m )/(2^m), {n, 1, 30} ]

a(n) = { ((n + 1)*(n + 2)/2)^4 } \\ Harry J. Smith, Jun 30 2009

[stirling_number2(n+1,n)^4for n in range(1,25)] # Zerinvary Lajos, Mar 14 2009

L(n) = ((n^m)(n + 1)^m)/(2^m) where m is the dimension, which in this case is 4.
O.g.f.: -(1+72*x+603*x^2+1168*x^3+603*x^4+72*x^5+x^6)/(-1+x)^9. - R. J. Mathar, Mar 31 2008
a(n) = A000217(n+1)^4. - R. J. Mathar, Dec 13 2011
a(n) = (A000539(n+1) + A000541(n+1))/2. - Philippe Deléham, May 25 2015
From Amiram Eldar, May 15 2022: (Start)
Sum_{n>=0} 1/a(n) = 160*Pi^2/3 + 16*Pi^4/45 - 560.
Sum_{n>=0} (-1)^n/a(n) = 560 - 640*log(2) - 96*zeta(3). (End)

Better definition from Zerinvary Lajos, May 23 2006

A059978 a(n) = binomial(n+2,n)^6.

Original entry on oeis.org

1, 729, 46656, 1000000, 11390625, 85766121, 481890304, 2176782336, 8303765625, 27680640625, 82653950016, 225199600704, 567869252041, 1340095640625, 2985984000000, 6327518887936, 12827693806929, 25002110044521, 47045881000000, 85766121000000, 151939915084881

Offset: 0

Robert G. Wilson v, Mar 06 2001

Number of 6-dimensional cage assemblies.

Clifford A. Pickover, "Wonders of Numbers, Adventures in Mathematics, Mind and Meaning," Oxford University Press, 2001, p. 325.

T. D. Noe, Table of n, a(n) for n = 0..1000
Clifford A. Pickover, "Wonders of Numbers, Adventures in Mathematics, Mind and Meaning," Zentralblatt review.
Index entries for linear recurrences with constant coefficients, signature (13,-78,286,-715,1287,-1716,1716,-1287,715,-286,78,-13,1).

Cf. A059827, A059860, A000217, A059977, A059980, A091043.

with (combinat):seq(mul(stirling2(n+1,n),k=1..6),n=1..18); # Zerinvary Lajos, Dec 14 2007

m = 6; Table[n^m (n + 1)^m/2^m, {n, 1, 24}]

G.f.: (x^10 + 716*x^9 + 37257*x^8 + 450048*x^7 + 1822014*x^6 +2864328*x^5 + 1822014*x^4 + 450048*x^3 + 37257*x^2 + 716*x + 1)/(1-x)^13. - Colin Barker, Jul 09 2012
G.f.: 6F5([3,3,3,3,3,3], [1,1,1,1,1], z). - Benedict W. J. Irwin, Mar 14 2016
a(n) = (1/16)*( 3*S(7,n+1) + 10*S(9,n+1) + 3*S(11,n+1) ), where S(r,n) = Sum_{k = 1..n} k^r. Cf. A059977 and A059980. - Peter Bala, Jul 02 2019
From Amiram Eldar, May 15 2022: (Start)
Sum_{n>=0} 1/a(n) = 2688*Pi^2 + 448*Pi^4/15 + 128*Pi^6/945 - 29568.
Sum_{n>=0} (-1)^n/a(n) = 29568 - 32256*log(2) - 5376*zeta(3) - 720*zeta(5). (End)

Better definition from Zerinvary Lajos, May 23 2006

A059979 Number of 7-dimensional cage assemblies.

Original entry on oeis.org

1, 2187, 279936, 10000000, 170859375, 1801088541, 13492928512, 78364164096, 373669453125, 1522435234375, 5455160701056, 17565568854912, 51676101935731, 140710042265625, 358318080000000, 860542568759296, 1962637152460137, 4275360817613091, 8938717390000000

Offset: 1

Robert G. Wilson v, Mar 06 2001

Clifford A. Pickover, "Wonders of Numbers, Adventures in Mathematics, Mind and Meaning," Oxford University Press, 2001, p. 325.

T. D. Noe, Table of n, a(n) for n = 1..1000
Clifford A. Pickover, "Wonders of Numbers, Adventures in Mathematics, Mind and Meaning," Zentralblatt review.
Index entries for linear recurrences with constant coefficients, signature (15,-105,455,-1365,3003,-5005,6435,-6435,5005,-3003,1365,-455,105,-15,1).

Cf. A059827, A059860.

m = 7; Table[ ( (n^m)(n + 1)^m )/(2^m), {n, 1, 20} ]
(Times@@@Partition[Range[20]^7,2,1])/2^7 (* Harvey P. Dale, Aug 20 2017 *)

G.f.: -x*(x^12 +2172*x^11 +247236*x^10+ 6030140*x^9 +49258935*x^8 +163809288*x^7 +242384856*x^6 +163809288*x^5 +49258935*x^4 +6030140*x^3 +247236*x^2 +2172*x +1)/(x-1)^15. - Colin Barker, Jul 09 2012
From Benedict W. J. Irwin, Mar 14 2016: (Start)
G.f.: z*7F6([3,3,3,3,3,3,3], [1,1,1,1,1,1], z).
a(n) = n^7*(1+n)^7/128.
(End)
a(n) = binomial(n+1, 2)^7. - Alejandro Rodriguez, Oct 20 2020
From Amiram Eldar, May 15 2022: (Start)
Sum_{n>=1} 1/a(n) = 219648 - 19712*Pi^2 - 3584*Pi^4/15 - 256*Pi^6/135.
Sum_{n>=1} (-1)^(n+1)/a(n) = 236544*log(2) + 40320*zeta(3) + 6720*zeta(5) + 252*zeta(7) - 219648. (End)

A059980 Number of 8-dimensional cage assemblies.

Original entry on oeis.org

1, 6561, 1679616, 100000000, 2562890625, 37822859361, 377801998336, 2821109907456, 16815125390625, 83733937890625, 360040606269696, 1370114370683136, 4702525276151521, 14774554437890625, 42998169600000000, 117033789351264256, 300283484326400961

Offset: 1

Robert G. Wilson v, Mar 06 2001

Clifford A. Pickover, "Wonders of Numbers, Adventures in Mathematics, Mind and Meaning," Oxford University Press, 2001, p. 325.

Clifford A. Pickover, "Wonders of Numbers, Adventures in Mathematics, Mind and Meaning," Zentralblatt review.
Index entries for linear recurrences with constant coefficients, signature (17,-136,680,-2380,6188,-12376,19448,-24310,24310,-19448,12376,-6188,2380,-680,136,-17,1).

Cf. A059827, A059860, A059977, A059978, A091043.

m = 8; Table[n^m (n + 1)^m/2^m, {n, 1, 18}]

G.f.: -x*(x^14 +6544*x^13 +1568215*x^12 +72338144*x^11 +1086859301*x^10 +6727188848*x^9 +19323413187*x^8 +27306899520*x^7 +19323413187*x^6 +6727188848*x^5 +1086859301*x^4 +72338144*x^3 +1568215*x^2 +6544*x +1)/(x-1)^17. - Colin Barker, Jul 09 2012
From Peter Bala, Jul 02 2019 (Start)
a(n) = (n*(n + 1)/2)^8.
a(n) = (1/16)*( S(9,n) + 7*S(11,n) + 7*S(13,n) + S(15,n) ), where S(r,n) = Sum_{k = 1..n} k^r. Cf. A059977 and A059978. (End)
From Amiram Eldar, May 15 2022: (Start)
Sum_{n>=1} 1/a(n) = 146432*Pi^2 + 5632*Pi^4/3 + 2048*Pi^6/105 + 256*Pi^8/4725 - 1647360.
Sum_{n>=1} (-1)^(n+1)/a(n) = 1647360 - 1757184*log(2) - 304128*zeta(3) - 57600*zeta(5) - 4032*zeta(7). (End)

A248720 a(n) = (n*(n+1))^5.

Original entry on oeis.org

0, 32, 7776, 248832, 3200000, 24300000, 130691232, 550731776, 1934917632, 5904900000, 16105100000, 40074642432, 92389579776, 199690286432, 408410100000, 796262400000, 1488827973632, 2682916351776, 4678757435232, 7923516800000, 13069123200000

Offset: 0

Eugene Chong, Oct 16 2014

This is the sequence (2^5)*A059860(n)= (2*binomial(n+1,2))^5, n >= 0. - Wolfdieter Lang, Nov 03 2014

Andrew Howroyd, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (11, -55, 165, -330, 462, -462, 330, -165, 55, -11, 1).

Cf. A059860, A002378 (n*(n+1)), A035287(n+1) ((n*(n+1))^2), A060459 ((n*(n+1))^3), A248619 ((n*(n+1))^4).

Magma
```
[(n*(n+1))^5: n in [0..30]];
```
Maple
```
[ seq(n^5*(n+1)^5, n = 0..100) ];
```

Table[(n (n + 1))^5, {n, 0, 70}] (* or *) CoefficientList[Series[32 x (x^8 + 232 x^7 + 5158 x^6 + 27664 x^5 + 47290 x^4 + 27664 x^3 + 5158 x^2 + 232 x + 1)/(1 - x)^11, {x, 0, 30}], x]
LinearRecurrence[{11,-55,165,-330,462,-462,330,-165,55,-11,1},{0,32,7776,248832,3200000,24300000,130691232,550731776,1934917632,5904900000,16105100000},20] (* Harvey P. Dale, Apr 23 2017 *)

a(n) = A002378(n)^5.
a(n) = 32*A059860(n) for n>0.
G.f.: 32*x*(x^8 + 232*x^7 + 5158*x^6 + 27664*x^5 + 47290*x^4 + 27664*x^3 + 5158*x^2 + 232*x + 1) / (1 - x)^11 (from A059860).
Sum_{n>=1} 1/a(n) = 126 - 35*Pi^2/3 - Pi^4/9. - Vaclav Kotesovec, Sep 25 2019
a(n) = 11*a(n-1) - 55*a(n-2) + 165*a(n-3) - 330*a(n-4) + 462*a(n-5) - 462*a(n-6) + 330*a(n-7) - 165*a(n-8) + 55*a(n-9) - 11*a(n-10) + a(n-11). - Wesley Ivan Hurt, Jan 20 2024

Terms a(32) and beyond corrected by Andrew Howroyd, Feb 20 2018

A091480 Table of multigraphs (by antidiagonals) with n (>=1) nodes and k (>=0) edges. Each type of object labeled from its own label set.

Original entry on oeis.org

1, 0, 1, 0, 1, 1, 0, 1, 3, 1, 0, 1, 9, 6, 1, 0, 1, 27, 36, 10, 1, 0, 1, 81, 216, 100, 15, 1, 0, 1, 243, 1296, 1000, 225, 21, 1, 0, 1, 729, 7776, 10000, 3375, 441, 28, 1, 0, 1, 2187, 46656, 100000, 50625, 9261, 784, 36, 1, 0, 1, 6561, 279936, 1000000, 759375

Offset: 1

Christian G. Bower, Jan 13 2004

			1  0   0    0     0 ...
1  1   1    1     1 ...
1  3   9   27    81 ...
1  6  36  216  1296 ...
1 10 100 1000 10000 ...

F. Bergeron, G. Labelle and P. Leroux, Combinatorial Species and Tree-Like Structures, Cambridge, 1998, p. 114 (2.4.44).

Columns 0-8: A000012, A000217(n-1), A000537(n-1), A059827(n-1), A059977(n-1), A059860(n-1), A059978(n-1), A059979(n-1), A059980(n-1).
Rows 1-10: A000007, A000012, A000244, A000400, A011557, A001024, A009965, A009972, A009980, A009989.
Cf. A091478.

a(n, k) = binomial(n, 2)^k.

cp's OEIS Frontend

A000537 Sum of first n cubes; or n-th triangular number squared.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

GAP

Haskell

Magma

Maple

Mathematica

PARI

Python

Formula

Extensions

A059977 a(n) = binomial(n+2, 2)^4.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Sage

Formula

Extensions

A059978 a(n) = binomial(n+2,n)^6.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Maple

Mathematica

Formula

Extensions

A059979 Number of 7-dimensional cage assemblies.

Views

Author

Keywords

References

Links

Crossrefs

Programs

Mathematica

Formula

A059980 Number of 8-dimensional cage assemblies.

Views

Author

Keywords

References

Links

Crossrefs

Programs

Mathematica

Formula

A248720 a(n) = (n*(n+1))^5.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Maple

Mathematica