

A000292


Tetrahedral (or triangular pyramidal) numbers: a(n) = C(n+2,3) = n*(n+1)*(n+2)/6.
(Formerly M3382 N1363)


587



0, 1, 4, 10, 20, 35, 56, 84, 120, 165, 220, 286, 364, 455, 560, 680, 816, 969, 1140, 1330, 1540, 1771, 2024, 2300, 2600, 2925, 3276, 3654, 4060, 4495, 4960, 5456, 5984, 6545, 7140, 7770, 8436, 9139, 9880, 10660, 11480, 12341, 13244, 14190, 15180
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,3


COMMENTS

a(n) = number of balls in a triangular pyramid in which each edge contains n balls.
One of the 5 Platonic polyhedral (tetrahedral, cube, octahedral, dodecahedral and icosahedral) numbers (cf. A053012).
Also (1/6)*(n^3 + 3*n^2 + 2*n) is the number of ways to color the vertices of a triangle using <= n colors, allowing rotations and reflections. Group is the dihedral group D_6 with cycle index (x1^3 + 2*x3 + 3*x1*x2)/6.
Also the convolution of the natural numbers with themselves.  Felix Goldberg (felixg(AT)tx.technion.ac.il), Feb 01 2001
Connected with the Eulerian numbers (1, 4, 1) via 1*a(x2) + 4*a(x1) + 1*a(x) = x^3.  Gottfried Helms, Apr 15 2002
a(n) = Sum_{1 <= i <= j <= n} i  j.  Amarnath Murthy, Aug 05 2002
a(n) = sum of all the possible products p*q where (p,q) are ordered pairs and p + q = n + 1. a(5) = 5 + 8 + 9 + 8 + 5 = 35.  Amarnath Murthy, May 29 2003
Number of labeled graphs on n+3 nodes that are triangles.  Jon Perry, Jun 14 2003
Number of permutations of n+3 which have exactly 1 descent and avoid the pattern 1324.  Mike Zabrocki, Nov 05 2004
Schlaefli symbol for this polyhedron: {3,3}.
Transform of n^2 under the Riordan array (1/(1x^2), x).  Paul Barry, Apr 16 2005
a(n) = A108299(n+5, 6) = A108299(n+6, 7).  Reinhard Zumkeller, Jun 01 2005
a(n) = A110555(n+4, 3).  Reinhard Zumkeller, Jul 27 2005
a(n) is a perfect square only for n = {1, 2, 48}. a(48) = 19600 = 140^2.  Alexander Adamchuk, Nov 24 2006
a(n+1) is the number of terms in the expansion of (a_1 + a_2 + a_3 + a_4)^n.  Sergio Falcon, Feb 12 2007 [Corrected by Graeme McRae, Aug 28 2007]
a(n+1) is the number of terms in the complete homogeneous symmetric polynomial of degree n in 3 variables.  Richard Barnes, Sep 06 2017
This is also the average "permutation entropy", sum((pi(n)n)^2)/n!, over the set of all possible n! permutations pi.  Jeff Boscole (jazzerciser(AT)hotmail.com), Mar 20 2007
a(n) = (d/dx)(S(n, x), x)_{x = 2}. First derivative of Chebyshev Spolynomials evaluated at x = 2. See A049310.  Wolfdieter Lang, Apr 04 2007
If X is an nset and Y a fixed (n1)subset of X then a(n2) is equal to the number of 3subsets of X intersecting Y.  Milan Janjic, Aug 15 2007
Complement of A145397; A023533(a(n))=1; A014306(a(n))=0.  Reinhard Zumkeller, Oct 14 2008
Equals row sums of triangle A152205.  Gary W. Adamson, Nov 29 2008
a(n) is the number of gifts received from the lyricist's true love up to and including day n in the song "The Twelve Days of Christmas". a(12) = 364, almost the number of days in the year.  Bernard Hill (bernard(AT)braeburn.co.uk), Dec 05 2008
Sequence of the absolute values of the z^1 coefficients of the polynomials in the GF2 denominators of A156925. See A157703 for background information.  Johannes W. Meijer, Mar 07 2009
Starting with 1 = row sums of triangle A158823.  Gary W. Adamson, Mar 28 2009
Wiener index of the path graph P_n.  Eric W. Weisstein, Apr 30 2009
This is a 'Matryoshka doll' sequence with alpha=0, the multiplicative counterpart is A000178: seq(add(add(i,i=alpha..k),k=alpha..n),n=alpha..50).  Peter Luschny, Jul 14 2009
a(n) is the number of nondecreasing, threeelement permutations of n distinct numbers.  Samuel Savitz, Sep 12 2009
a(n+4) = Number of different partitions of number n on sum of 4 elements a(6) = a(2+4) because we have 10 different partitions of 2 on sum of 4 elements 2 = 2 + 0 + 0 + 0 = 1 + 1 + 0 + 0 = 0 + 2 + 0 + 0 = 1 + 0 + 1 + 0 = 0 + 1 + 1 + 0 = 0 + 0 + 2 + 0 = 1 + 0 + 0 + 1 = 0 + 1 + 0 + 1 = 0 + 0 + 1 + 1 = 0 + 0 + 0 + 2.  Artur Jasinski, Nov 30 2009
a(n) corresponds to the total number of steps to memorize n verses by the technique described in A173564.  Ibrahima Faye (ifaye2001(AT)yahoo.fr), Feb 22 2010
The number of (n+2)bit numbers which contain two runs of 1's in their binary expansion.  Vladimir Shevelev, Jul 30 2010
a(n) is also, starting at the second term, the number of triangles formed in ngons by intersecting diagonals with three diagonal endpoints (see the first column of the table in Sommars link).  Alexandre Wajnberg, Aug 21 2010
Column sums of:
1 4 9 16 25...
1 4 9...
1...
..............

1 4 10 20 35...
From Johannes W. Meijer, May 20 2011: (Start)
The Ca3, Ca4, Gi3 and Gi4 triangle sums (see A180662 for their definitions) of the ConnellPol triangle A159797 are linear sums of shifted versions of the duplicated tetrahedral numbers, e.g., Gi3(n) = 17*a(n) + 19*a(n1) and Gi4(n) = 5*a(n) + a(n1).
Furthermore the Kn3, Kn4, Ca3, Ca4, Gi3 and Gi4 triangle sums of the Connell sequence A001614 as a triangle are also linear sums of shifted versions of the sequence given above. (End)
a(n2)=N_0(n), n >= 1, with a(1):=0, is the number of vertices of n planes in generic position in threedimensional space. See a comment under A000125 for general arrangement. Comment to Arnold's problem 199011, see the Arnold reference, p. 506.  Wolfdieter Lang, May 27 2011
We consider optimal proper vertex colorings of a graph G. Assume that the labeling, i.e., coloring starts with 1. By optimality we mean that the maximum label used is the minimum of the maximum integer label used across all possible labelings of G. Let S=Sum of the differences l(v)  l(u), the sum being over all edges uv of G and l(w) is the label associated with a vertex w of G. We say G admits unique labeling if all possible labelings of G is Sinvariant and yields the same integer partition of S. With an offset this sequence gives the Svalues for the complete graph on n vertices, n = 2, 3, ... .  K.V.Iyer, Jul 08 2011
Central term of commutator of transverse Virasoro operators in 4D case for relativistic quantum open strings (ref. Zwiebach).  Tom Copeland, Sep 13 2011
Appears as a coefficient of a SturmLiouville operator in the Ovsienko reference on page 43.  Tom Copeland, Sep 13 2011
For n > 0: a(n) = number of triples (u,v,w) with 1 <= u <= v <= w <= n, cf. A200737.  Reinhard Zumkeller, Nov 21 2011
Regarding the second comment above by Amarnath Murthy (May 29 2003), see A181118 which gives the sequence of ordered pairs.  L. Edson Jeffery, Dec 17 2011
The dimension of the space spanned by the 3form v[ijk] that couples to M2brane worldsheets wrapping 3cycles inside tori (ref. Green, Miller, Vanhove eq. 3.9).  Stephen Crowley, Jan 05 2012
a(n+1) is the number of 2 X 2 matrices with all terms in {0, 1, ..., n} and (sum of terms) = n. Also, a(n+1) is the number of 2 X 2 matrices with all terms in {0, 1, ..., n} and (sum of terms) = 3n.  Clark Kimberling, Mar 19 2012
a(n) = A004006(n)  n  1.  Reinhard Zumkeller, Mar 31 2012
Using n + 4 consecutive triangular numbers t(1), t(2), ..., t(n+4), where n is the nth term of this sequence, create a polygon by connecting points (t(1), (t(2)) to (t(2), t(3)), (t(2), t(3)) to (t(3), t(4)), ..., (t(1), t(2)) to (t(n+3), t(n+4)). The area of this polygon will be onehalf of each term in this sequence.  J. M. Bergot, May 05 2012
Pisano period lengths: 1, 4, 9, 8, 5, 36, 7, 16, 27, 20, 11, 72, 13, 28, 45, 32, 17,108, 19, 40, ... . (The Pisano sequence modulo m is the auxiliary sequence p(n) = a(n) mod m, n >= 1, for some m. p(n) is periodic for all sequences with rational g.f., like this one, and others. The lengths of the period of p(n) are quoted here for m>=1.)  R. J. Mathar, Aug 10 2012
a(n) = the maximum possible number of rooted triplets consistent with any phylogenetic tree (level0 phylogenetic network) containing exactly n+2 leaves.  Jesper Jansson, Sep 10 2012
For n > 0, the digital roots of this sequence A010888(a(n)) form the purely periodic 27cycle {1, 4, 1, 2, 8, 2, 3, 3, 3, 4, 7, 4, 5, 2, 5, 6, 6, 6, 7, 1, 7, 8, 5, 8, 9, 9, 9}, which just rephrases the pisano period length above.  Ant King, Oct 18 2012
a(n) is the number of functions f from {1, 2, 3} to {1, 2, ..., n + 4} such that f(1) + 1 < f(2) and f(2) + 1 < f(3).  Dennis P. Walsh, Nov 27 2012
a(n) is the Szeged index of the path graph with n+1 vertices; see the Diudea et al. reference, p. 155, Eq. (5.8).  Emeric Deutsch, Aug 01 2013
Also the number of permutations of length n that can be sorted by a single block transposition.  Vincent Vatter, Aug 21 2013
From J. M. Bergot, Sep 10 2013: (Start)
a(n) is the 3 X 3 matrix determinant
 C(n,1) C(n,2) C(n,3) 
 C(n+1,1) C(n+1,2) C(n+1,3) 
 C(n+2,1) C(n+2,2) C(n+2,3) 
(End)
In physics, a(n)/2 is the trace of the spin operator S_z^2 for a particle with spin S=n/2. For example, when S=3/2, the S_z eigenvalues are 3/2, 1/2, +1/2, +3/2 and the sum of their squares is 10/2 = a(3)/2.  Stanislav Sykora, Nov 06 2013
a(n+1) = (n+1)*(n+2)*(n+3)/6 is also the dimension of the Hilbert space of homogeneous polynomials of degree n.  L. Edson Jeffery, Dec 12 2013
For n >= 4, a(n3) is the number of permutations of 1,2...,n with the distribution of up (1)  down (0) elements 0...0111 (n4 zeros), or, equivalently, a(n3) is updown coefficient {n,7} (see comment in A060351).  Vladimir Shevelev, Feb 15 2014
a(n) = onehalf the area of the region created by plotting the points (n^2,(n+1)^2). A line connects points (n^2,(n+1)^2) and ((n+1)^2, (n+2)^2) and a line is drawn from (0,1) to each increasing point. From (0,1) to (4,9) the area is 2; from (0,1) to (9,16) the area is 8; further areas are 20,40,70,...,2*a(n).  J. M. Bergot, May 29 2014
Beukers and Top prove that no tetrahedral number > 1 equals a square pyramidal number A000330.  Jonathan Sondow, Jun 21 2014
a(n+1) is for n >= 1 the number of nondecreasing nletter words over the alphabet [4] = {1, 2, 3, 4} (or any other four distinct numbers). a(2+1) = 10 from the words 11, 22, 33, 44, 12, 13, 14, 23, 24, 34; which is also the maximal number of distinct elements in a symmetric 4 X 4 matrix. Inspired by the Jul 20 2014 comment by R. J. Cano on A000582.  Wolfdieter Lang, Jul 29 2014
Degree of the qpolynomial counting the orbits of plane partitions under the action of the symmetric group S3. Orbitcounting generating function is product_{i <= j <= k <= n} ( (1  q^(i + j + k  1))/(1  q^(i + j + k  2)) ). See qTSPP reference.  Olivier Gérard, Feb 25 2015
Row lengths of tables A248141 and A248147.  Reinhard Zumkeller, Oct 02 2014
If n is even then a(n) = Sum_{k=1..n/2} (2k)^2. If n is odd then a(n) = Sum_{k=0..(n1)/2} (1+2k)^2. This can be illustrated as stacking boxes inside a square pyramid on plateaus of edge lengths 2k or 2k+1, respectively. The largest k are the 2k X 2k or (2k+1) X (2k+1) base.  R. K. Guy, Feb 26 2015
Draw n lines in general position in the plane. Any three define a triangle, so in all we see C(n,3) = a(n2) triangles (6 lines produce 4 triangles, and so on).  Terry Stickels, Jul 21 2015
a(n2) = fallfac(n,3)/3!, n >= 3, is also the number of independent components of an antisymmetric tensor of rank 3 and dimension n. Here fallfac is the falling factorial.  Wolfdieter Lang, Dec 10 2015
Number of compositions (ordered partitions) of n+3 into exactly 4 parts.  Juergen Will, Jan 02 2016
Number of weak compositions (ordered weak partitions) of n1 into exactly 4 parts.  Juergen Will, Jan 02 2016
For n >= 2 gives the number of multiplications of two nonzero matrix elements in calculating the product of two upper n X n triangular matrices.  John M. Coffey, Jun 23 2016
Terms a(4n+1), n >= 0, are odd, all others are even. The 2adic valuation of the subsequence of every other term, a(2n+1), n >= 0, yields the ruler sequence A007814. Sequence A275019 gives the 2adic valuation of a(n).  M. F. Hasler, Dec 05 2016
Does not satisfy Benford's law [Ross, 2012].  N. J. A. Sloane, Feb 12 2017


REFERENCES

M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 828.
V. I. Arnold (ed.), Arnold's Problems, Springer, 2004, comments on Problem 199011 (p. 75), pp. 503510. Numbers N_0.
A. H. Beiler, Recreations in the Theory of Numbers, Dover, NY, 1964, p. 194.
J. H. Conway and R. K. Guy, The Book of Numbers, Copernicus Press, NY, 1996, p. 83.
H. S. M. Coxeter, Polyhedral numbers, pp. 2535 of R. S. Cohen, J. J. Stachel and M. W. Wartofsky, eds., For Dirk Struik: Scientific, historical and political essays in honor of Dirk J. Struik, Reidel, Dordrecht, 1974.
E. Deza and M. M. Deza, Figurate numbers, World Scientific Publishing (2012), page 93.
L. E. Dickson, History of the Theory of Numbers. Carnegie Institute Public. 256, Washington, DC, Vol. 1, 1919; Vol. 2, 1920; Vol. 3, 1923, see vol. 2, p. 4.
M. V. Diudea, I. Gutman, J. Lorentz, Molecular Topology, Nova Science, 2001, Huntington, N.Y. pp. 152156.
J. C. P. Miller, editor, Table of Binomial Coefficients. Royal Society Mathematical Tables, Vol. 3, Cambridge Univ. Press, 1954.
V. Ovsienko and S. Tabachnikov, Projective Differential Geometry Old and New, Cambridge Tracts in Mathematics (no. 165), Cambridge Univ. Press, 2005.
Kenneth A Ross, First Digits of Squares and Cubes, Math. Mag. 85 (2012) 3642. doi:10.4169/math.mag.85.1.36.
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).
A. Szenes, The combinatorics of the Verlinde formulas (N.J. Hitchin et al., ed.), in Vector bundles in algebraic geometry, Cambridge, 1995.
D. Wells, The Penguin Dictionary of Curious and interesting Numbers, pp. 1267 Penguin Books 1987.
B. Zwiebach, A First Course in String Theory, Cambridge, 2004; see p. 226.


LINKS

N. J. A. Sloane, Table of n, a(n) for n = 0..10000
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].
O. Aichholzer and H. Krasser, The point set order type data base: a collection of applications and results, pp. 1720 in Abstracts 13th Canadian Conference on Computational Geometry (CCCG '01), Waterloo, Aug. 1315, 2001.
Luciano Ancora, The Square Pyramidal Number and other figurate numbers, ch. 5.
F. Beukers and J. Top, On oranges and integral points on certain plane cubic curves, Nieuw Arch. Wiskd., IV (1988), Ser. 6, No. 3, 203210.
P. J. Cameron, Sequences realized by oligomorphic permutation groups, J. Integ. Seqs. Vol. 3 (2000), #00.1.5.
Michael B. Green, Stephen D. Miller, and Pierre Vanhove, Small representations, string instantons, and Fourier modes of Eisenstein series, arXiv:1111.2983 [hepth], 20112013.
N. Heninger, E. M. Rains and N. J. A. Sloane, On the Integrality of nth Roots of Generating Functions, J. Combinatorial Theory, Series A, 113 (2006), 17321745.
N. Heninger, E. M. Rains and N. J. A. Sloane, On the Integrality of nth Roots of Generating Functions, arXiv:math/0509316 [math.NT], 20052006.
A. M. Hinz, S. Klavžar, U. Milutinović, C. Petr, The Tower of Hanoi  Myths and Maths, Birkhäuser 2013. See page 46. Book's website
Cheyne Homberger, Patterns in Permutations and Involutions: A Structural and Enumerative Approach, arXiv preprint 1410.2657 [math.CO], 2014.
C. Homberger, V. Vatter, On the effective and automatic enumeration of polynomial permutation classes, arXiv preprint arXiv:1308.4946 [math.CO], 2013.
Milan Janjic, Two Enumerative Functions
Virginia Johnson, Charles K. Cook, Areas of Triangles and other Polygons with Vertices from Various Sequences, arXiv:1608.02420 [math.CO], 2016.
R. Jovanovic, First 2500 Tetrahedral numbers
Hyun Kwang Kim, On Regular Polytope Numbers, Proc. Amer. Math. Soc., 131 (2002), 6575.
C. Koutschan, M. Kauers, D. Zeilberger, A Proof Of George Andrews' and David Robbins' qTSPP Conjecture, Proc. Nat. Acad. Sc., vol. 108 no. 6 (2011), p21962199. See also Zeilberger's page for this article.
T. Langley, J. Liese, J. Remmel, Generating Functions for Wilf Equivalence Under Generalized Factor Order , J. Int. Seq. 14 (2011) # 11.4.2
P. A. MacMahon, Memoir on the Theory of the Compositions of Numbers, Phil. Trans. Royal Soc. London A, 184 (1893), 835901.  Juergen Will, Jan 02 2016
T. P. Martin, Shells of atoms, Phys. Reports, 273 (1996), 199241, eq. (1).
Alexsandar Petojevic, The Function vM_m(s; a; z) and Some WellKnown Sequences, Journal of Integer Sequences, Vol. 5 (2002), Article 02.1.7
Luis Manuel Rivera, Integer sequences and kcommuting permutations, arXiv preprint arXiv:1406.3081 [math.CO], 2014.
N. J. A. Sloane, Illustration of initial terms
N. J. A. Sloane, Pyramid of 20 balls corresponding to a(3)=20.
S. E. Sommars and T. Sommars, Number of Triangles Formed by Intersecting Diagonals of a Regular Polygon, J. Integer Sequences, 1 (1998), #98.1.5.
H. StammWilbrandt, Sum of Pascal's triangle reciprocals
G. Villemin's Almanach of Numbers, Nombres Tetraedriques
Eric Weisstein's World of Mathematics, Composition
Eric Weisstein's World of Mathematics, Path Graph
Eric Weisstein's World of Mathematics, Tetrahedral Number
Eric Weisstein's World of Mathematics, Wiener Index
A. F. Y. Zhao, Pattern Popularity in Multiply Restricted Permutations, Journal of Integer Sequences, 17 (2014), #14.10.3.
Index entries for "core" sequences
Index to sequences related to pyramidal numbers
Index entries for linear recurrences with constant coefficients, signature (4,6,4,1).
Index entries for twoway infinite sequences
Index entries for sequences related to Benford's law


FORMULA

a(n) = C(n+2,3) = n*(n+1)*(n+2)/6 (see the name).
G.f.: x / (1  x)^4.
a(n) = a(4  n) for all in Z.
a(n) = Sum_{k=0..n} A000217(k), partial sums of the triangular numbers.
a(n) = (n+3)*a(n1)/n.  Ralf Stephan, Apr 26 2003
Sums of three consecutive terms give A006003.  Ralf Stephan, Apr 26 2003
a(n) = C(1, 2) + C(2, 2) + ... + C(n1, 2) + C(n, 2); e.g., for n = 5: a(5) = 0 + 1 + 3 + 6 + 10 = 20.  Labos Elemer, May 09 2003
Determinant of the n X n symmetric Pascal matrix M_(i, j) = C(i+j+2, i).  Benoit Cloitre, Aug 19 2003
The sum of a series constructed by the products of the index and the length of the series (n) minus the index (i): a(n) = sum[i(ni)]. Also the sum of n terms of A000217.  Martin Steven McCormick (mathseq(AT)wazer.net), Apr 06 2005
a(n) = Sum_{k=0..floor((n1)/2)} (n2k)^2 [offset 0]; a(n+1) = Sum_{k=0..n} k^2*(1(1)^(n+k1))/2 [offset 0].  Paul Barry, Apr 16 2005
Values of the Verlinde formula for SL_2, with g = 2: a(n) = Sum_{j=1..n1} n/(2*sin^2(j*Pi/n)).  Simone Severini, Sep 25 2006
a(n) = Sum_{m=1..n} Sum_{k=1..m} k.  Alexander Adamchuk, Oct 28 2006
a(n) = Sum_{k=1..n} binomial(n*k+1, n*k1), with a(0) = 0.  Paolo P. Lava, Apr 13 2007
a(n1) = (1/(1!*2!))*Sum_{1 <= x_1, x_2 <= n} det V(x_1, x_2) = (1/2)*Sum_{1 <= i,j <= n} ij, where V(x_1, x_2) is the Vandermonde matrix of order 2. Column 2 of A133112.  Peter Bala, Sep 13 2007
Starting with 1 = binomial transform of [1, 3, 3, 1, ...]; e.g., a(4) = 20 = (1, 3, 3, 1) dot (1, 3, 3, 1) = (1 + 9 + 9 + 1).  Gary W. Adamson, Nov 04 2007
a(n) = A006503(n)  A002378(n).  Reinhard Zumkeller, Sep 24 2008
a(n) = 4*a(n1)  6*a(n2) + 4*a(n3)  a(n4) for n >= 4.  Jaume Oliver Lafont, Nov 18 2008
Sum_{n>=1} 1/a(n) = 3/2, case x = 1 in GradsteinRyshik 1.513.7.  R. J. Mathar, Jan 27 2009
E.g.f.:((x^3)/6 + x^2 + x)*exp(x).  Geoffrey Critzer, Feb 21 2009
Lim{n > oo} A171973(n)/a(n) = sqrt(2)/2.  Reinhard Zumkeller, Jan 20 2010
With offset 1, a(n) = (1/6)*floor(n^5/(n^2 + 1)).  Gary Detlefs, Feb 14 2010
a(n) = Sum_{k = 1..n} k*(nk+1).  Vladimir Shevelev, Jul 30 2010
a(n) = (3*n^2 + 6*n + 2)/(6*(h(n+2)  h(n1))), n > 0, where h(n) is the nth harmonic number.  Gary Detlefs, Jul 01 2011
a(n) = coefficient of x^2 in the Maclaurin expansion of 1 + 1/(x+1) + 1/(x+1)^2 + 1/(x+1)^3 + ... + 1/(x+1)^n.  Francesco Daddi, Aug 02 2011
a(n) = coefficient of x^4 in the Maclaurin expansion of sin(x)*exp((n+1)*x).  Francesco Daddi, Aug 04 2011
a(n) = 2*A002415(n+1)/(n+1).  Tom Copeland, Sep 13 2011
a(n) = (A007531(n) + A027480(n) + A007290(n))/11.  J. M. Bergot, May 28 2012
a(n) = 3*a(n1)  3*a(n2) + a(n3) + 1.  Ant King, Oct 18 2012
G.f.: x*U(0) where U(k) = 1 + 2*x*(k+2)/( 2*k+1  x*(2*k+1)*(2*k+5)/(x*(2*k+5)+(2*k+2)/U(k+1) )); (continued fraction, 3rd kind, 3step).  Sergei N. Gladkovskii, Dec 01 2012
a(n) = Sum_{i=1..n} binomial(i+1,2).  Enrique Pérez Herrero, Feb 21 2013
a(n^2  1) = (1/2)*(a(n^2  n  2) + a(n^2 + n  2)) and
a(n^2 + n  2)  a(n^2  1) = a(n1)*(3*n^2  2) = 10*A024166(n1), by Berselli's formula in A222716.  Jonathan Sondow, Mar 04 2013
G.f.: x+4*x^2/(Q(0)4*x) where Q(k) = 1 + k*(x+1) + 4*x  x*(k+1)*(k+5)/Q(k+1); (continued fraction).  Sergei N. Gladkovskii, Mar 14 2013
a(n+1) = det(C(i+3,j+2), 1 <= i,j <= n), where C(n,k) are binomial coefficients.  Mircea Merca, Apr 06 2013
a(n) = a(n2) + n^2, for n > 1.  Ivan N. Ianakiev, Apr 16 2013
a(2n) = 4*(a(n1) + a(n)), for n > 0.  Ivan N. Ianakiev, Apr 26 2013
G.f.: x*G(0)/2, where G(k)= 1 + 1/(1  x/(x + (k+1)/(k+4)/G(k+1))); (continued fraction).  Sergei N. Gladkovskii, Jun 02 2013
a(n) = n + 2*a(n1)  a(n2), with a(0) = a(1) = 0.  Richard R. Forberg, Jul 11 2013
a(n)*(m+1)^3 + a(m)*(n+1) = a(n*m + n + m), for any nonnegative integers m and n. This is a 3D analog of Euler's theorem about triangular numbers, namely t(n)*(2m+1)^2 + t(m) = t(2nm + n + m), where t(n) is the nth triangular number.  Ivan N. Ianakiev, Aug 20 2013
Sum_{n>=0} a(n)/(n+1)! = 2*e/3 = 1.8121878856393... . Sum_{n>=1} a(n)/n! = 13*e/6 = 5.88961062832... .  Richard R. Forberg, Dec 25 2013
a(n+1) = A023855(n+1) + A023856(n).  Wesley Ivan Hurt, Sep 24 2013
For n >= 0, a(n)/2 = sqrt(((A005563(n))^3 + (A005563(n))^2)/144). Equivalently, a(n)/2 = (1/3)*sqrt((4*(s*(s + 1))^3 + (s*(s + 1))^2)) with s = n/2 (spin quantum number). s(s+1) = (2*Pi*S/h)^2 where S = Spin angular momentum and h = Planck's constant (see comments by Stanislav Sykora in this sequence and in A005563).  Raphie Frank, Jan 17 2014
a(n) = A024916(n) + A076664(n), n >= 1.  Omar E. Pol, Feb 11 2014
a(n) = A212560(n)  A059722(n).  J. M. Bergot, Mar 08 2014
Sum_{n>=1} (1)^(n + 1)/a(n) = 12*log(2)  15/2 = 0.8177661667... See A242024, A242023.  Richard R. Forberg, Aug 11 2014
3/(Sum_{n>=m} 1/a(n)) = A002378(m), for m > 0.  Richard R. Forberg, Aug 12 2014
a(n) = Sum_{i=1..n} Sum_{j=i..n} min(i,j).  Enrique Pérez Herrero, Dec 03 2014
Arithmetic mean of Square pyramidal number and Triangular number: a(n) = (A000330(n) + A000217(n))/2.  Luciano Ancora, Mar 14 2015
a(k*n) = a(k)*a(n) + 4*a(k1)*a(n1) + a(k2)*a(n2).  Robert Israel, Apr 20 2015
Dirichlet g.f.: (zeta(s3) + 3*zeta(s2) + 2*zeta(s1))/6.  Ilya Gutkovskiy, Jul 01 2016
a(n) = A080851(1,n1)  R. J. Mathar, Jul 28 2016
a(n) = (A000578(n+1)  (n+1) ) / 6.  Zhandos Mambetaliyev, Nov 24 2016
G.f.: x/(1  x)^4 = (x * r(x) * r(x^2) * r(x^4) * r(x^8) * ...), where r(x) = (1 + x)^4 = (1 + 4x + 6x^2 + 4x^3 + x^4); and x/(1  x)^4 = (x * r(x) * r(x^3) * r(x^9) * r(x^27) * ...) where r(x) = (1 + x + x^2)^4.  Gary W. Adamson, Jan 23 2017
a(n) = A000332(n+3)  A000332(n+2).  Bruce J. Nicholson, Apr 08 2017


EXAMPLE

a(2) = 3*4*5/6 = 10, the number of balls in a pyramid of 3 layers of balls, 6 in a triangle at the bottom, 3 in the middle layer and 1 on top.
Consider the square array
1 2 3 4 5 6 ...
2 4 6 8 10 12 ...
3 6 9 12 16 20 ...
4 8 12 16 20 24 ...
5 10 15 20 25 30 ...
...
then a(n) = sum of nth antidiagonal.  Amarnath Murthy, Apr 06 2003
G.f. = x + 4*x^2 + 10*x^3 + 20*x^4 + 35*x^5 + 56*x^6 + 84*x^7 + 120*x^8 + 165*x^9 + ...
Example for a(3+1) = 20 nondecreasing 3letter words over {1,2,3,4}: 111, 222, 333; 444, 112, 113, 114, 223, 224, 122, 224, 133, 233, 144, 244, 344; 123, 124, 134, 234. 4 + 4*3 + 4 = 20.  Wolfdieter Lang, Jul 29 2014
Example for a(42) = 4 independent components of a rank 3 antisymmetric tensor A of dimension 4: A(1,2,3), A(1,2,4), A(1,3,4) and A(2,3,4).  Wolfdieter Lang, Dec 10 2015


MAPLE

a:=n>n*(n+1)*(n+2)/6; seq(a(n), n=0..50);
A000292 := n>binomial(n+2, 3); seq(A000292(n), n=0..50);


MATHEMATICA

Table[Binomial[n + 2, 3], {n, 0, 20}] (* Zerinvary Lajos, Jan 31 2010 *)
FoldList[Plus, 0, Rest[FoldLtetrist[Plus, 0, Range[50]]]] (* corrected by Robert G. Wilson v, Jun 26 2013 *)
Accumulate[Accumulate[Range[0, 50]]] (* Harvey P. Dale, Dec 10 2011 *)
Table[n (n + 1)(n + 2)/6, {n, 0, 100}] (* Wesley Ivan Hurt, Sep 25 2013 *)
Nest[Accumulate, Range[0, 50], 2] (* Harvey P. Dale, May 24 2017 *)
Binomial[Range[20] + 1, 3] (* Eric W. Weisstein, Sep 08 2017 *)
LinearRecurrence[{4, 6, 4, 1}, {0, 1, 4, 10}, 20] (* Eric W. Weisstein, Sep 08 2017 *)
CoefficientList[Series[x/(1 + x)^4, {x, 0, 20}], x] (* Eric W. Weisstein, Sep 08 2017 *)


PROG

(PARI) a(n) = (n) * (n+1) * (n+2) / 6
(PARI) a=vector(10000); a[2]=1; for(i=3, #a, a[i]=a[i2]+i*i); \\ Stanislav Sykora, Nov 07 2013
(PARI) is(n)=my(k=sqrtnint(6*n, 3)); k*(k+1)*(k+2)==6*n \\ Charles R Greathouse IV, Dec 13 2016
(DERIVE) v(n):= [1, 2, 3, ..., n] w(n):= [n, ..., 3, 2, 1] a(n):= scalar product (v(n)w(n)) " From Roland Schroeder (florola(AT)gmx.de), Aug 14 2010 "
(Haskell)
a000292 n = n * (n + 1) * (n + 2) `div` 6
a000292_list = scanl1 (+) a000217_list
 Reinhard Zumkeller, Jun 16 2013, Feb 09 2012, Nov 21 2011
(Maxima) A000292(n):=n*(n+1)*(n+2)/6$ makelist(A000292(n), n, 0, 60); /* Martin Ettl, Oct 24 2012 */
(MAGMA) [n*(n+1)*(n+2)/6: n in [0..50]]; // Wesley Ivan Hurt, Jun 03 2014


CROSSREFS

Bisections give A000447 and A002492.
Sums of 2 consecutive terms give A000330.
a(3n3) = A006566(n). A000447(n) = a(2n2). A002492(n) = a(2n+1).
Column 0 of triangle A094415.
Cf. A000217 (first differences), A001044, (see above example), A061552, A040977, A133111, A133112, A152205, A158823, A156925, A157703, A173564, A058187, A190717, A190718, A100440, A181118, A222716.
Partial sums are A000332.  Jonathan Vos Post, Mar 27 2011
Cf. A216499 (the analogous sequence for level1 phylogenetic networks).
Cf. A068980 (partitions), A231303 (spin physics).
Cf. similar sequences listed in A237616.
Cf. A104712 (second column, if offset is 2).
Cf. A145397 (nontetrahedral numbers).  Daniel Forgues, Apr 11 2015
Cf. A127324.
Cf. A007814, A275019 (2adic valuation).
Sequence in context: A201722 A090579 A276643 * A101552 A038419 A057319
Adjacent sequences: A000289 A000290 A000291 * A000293 A000294 A000295


KEYWORD

nonn,core,easy,nice


AUTHOR

N. J. A. Sloane, Apr 30 1991


EXTENSIONS

PARI program corrected by Harry J. Smith, Dec 22 2008
Corrected and edited by Daniel Forgues, May 14 2010


STATUS

approved



