# Tetrahedral number

A pyramid with side length 5 contains 35 spheres. Each layer represents one of the first five triangular numbers.

A tetrahedral number, or triangular pyramidal number, is a figurate number that represents a pyramid with a triangular base and three sides, called a tetrahedron. The n-th tetrahedral number, ${\displaystyle T_{n}}$, is the sum of the first n triangular numbers, that is, ${\displaystyle T_{n}=\sum _{k\mathop {=} 1}^{n}{\frac {k(k+1)}{2}}}$

The tetrahedral numbers are:

1, 4, 10, 20, 35, 56, 84, 120, 165, 220, … (sequence A000292 in the OEIS)

## Formula

Derivation of tetrahedral numbers from a left-justified Pascal's triangle

The formula for the n-th tetrahedral number is represented by the 3rd rising factorial of n divided by the factorial of 3:

${\displaystyle T_{n}={n(n+1)(n+2) \over 6}={n^{\overline {3}} \over 3!}}$

The tetrahedral numbers can also be represented as binomial coefficients:

${\displaystyle T_{n}={n+2 \choose 3}.}$

Tetrahedral numbers can therefore be found in the fourth position either from left or right in Pascal's triangle.

### Proof 1

This proof uses the fact that the n-th triangular number is given by

${\displaystyle {\mathit {Tri}}_{n}={n(n+1) \over 2}.}$

It proceeds by induction.

Base case
${\displaystyle T_{1}=1={1\cdot 2\cdot 3 \over 6}.}$
Inductive step
 ${\displaystyle T_{n+1}}$ ${\displaystyle =T_{n}+{\mathit {Tri}}_{n+1}={n(n+1)(n+2) \over 6}+{(n+1)(n+2) \over 2}}$ ${\displaystyle ={(n+1)(n+2)(n+3) \over 6}.}$

## Geometric interpretation

Tetrahedral numbers can be modelled by stacking spheres. For example, the fifth tetrahedral number (T5 = 35) can be modelled with 35 billiard balls and the standard triangular billiards ball frame that holds 15 balls in place. Then 10 more balls are stacked on top of those, then another 6, then another three and one ball at the top completes the tetrahedron.

When order-n tetrahedra built from Tn spheres are used as a unit, it can be shown that a space tiling with such units can achieve a densest sphere packing as long as n ≤ 4.[1][dubious ]

## Properties

• Tn + Tn-1 = 12 + 22 + 32 ... + n2
• A. J. Meyl proved in 1878 that only three tetrahedral numbers are also perfect squares, namely:
T1 = 1² = 1
T2 = 2² = 4
T48 = 140² = 19600.
• Sir Frederick Pollock conjectured that every number is the sum of at most 5 tetrahedral numbers: see Pollock tetrahedral numbers conjecture.
• The only tetrahedral number that is also a square pyramidal number is 1 (Beukers, 1988), and the only tetrahedral number that is also a perfect cube is 1.
• The infinite sum of tetrahedral numbers' reciprocals is 3/2, which can be derived using telescoping series:
${\displaystyle \!\ \sum _{n=1}^{\infty }{\frac {6}{n(n+1)(n+2)}}={\frac {3}{2}}.}$
• The parity of tetrahedral numbers follows the repeating pattern odd-even-even-even.
• An observation of tetrahedral numbers:
T5 = T4 + T3 + T2 + T1
• Numbers that are both triangular and tetrahedral must satisfy the binomial coefficient equation:
${\displaystyle Tr_{n}={n+1 \choose 2}={m+2 \choose 3}=Te_{m}.}$
• The only numbers that are both Tetrahedral and Triangular numbers are (sequence A027568 in the OEIS):
Te1 = Tr1 = 1
Te3 = Tr4 = 10
Te8 = Tr15 = 120
Te20 = Tr55 = 1540
Te34 = Tr119 = 7140

## Popular culture

Number of gifts of each type and number received each day and their relationship to figurate numbers

Te12 = 364, which is the total number of gifts "my true love sent to me" during the course of all 12 verses of the carol, "The Twelve Days of Christmas".[2] The cumulative total number of gifts after each verse is also Ten for verse n.

The number of possible KeyForge three-house-combinations is also a tetrahedral number, Ten-2 where n is the number of houses.