# Tetrahedral number

*1,069*pages on

this wiki

## Ad blocker interference detected!

### Wikia is a free-to-use site that makes money from advertising. We have a modified experience for viewers using ad blockers

Wikia is not accessible if you’ve made further modifications. Remove the custom ad blocker rule(s) and the page will load as expected.

A **tetrahedral number**, or **triangular pyramidal number**, or **Digonal Deltahedral number** is a figurate number that represents a pyramid with a triangular base and three sides, called a tetrahedron. The *n*th tetrahedral number is the sum of the first *n* triangular numbers added up.

The first few tetrahedral numbers (sequence A000292 in OEIS) are:

The formula for the *n*-th tetrahedral number is represented by the 3rd Rising Factorial divided by the 3rd Factorial.

Tetrahedral numbers are found in the fourth position either from left to right or right to left in Pascal's triangle. The tetrahedral numbers are therefore binomial coefficients:

Tetrahedral numbers can be modelled by stacking spheres. For example, the fifth tetrahedral number (*T*_{5} = 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.

A.J. Meyl proved in 1878 that only three tetrahedral numbers are also perfect squares, namely:

*T*_{1}= 1² = 1*T*_{2}= 2² = 4*T*_{48}= 140² = 19600.

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.

Another interesting fact about tetrahedral numbers is that the infinite sum of their reciprocals is 3/2, which can be derived using telescoping series.

The tetrahedron with basic length 4 (summing up to 20) can be looked at as the 3-dimensional analogue of the tetractys, the 4th triangular number (summing up to 10). The tetractys was considered holy by the Pythagoreans.

When order-*n* tetrahedra built from *T*_{n} 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].

The parity of tetrahedral numbers follows the repeating pattern odd-even-even-even.

An observation of tetrahedral numbers:
*T*_{5} = *T*_{4} + *T*_{3} + *T*_{2} + *T*_{1}

Numbers that are both triangular and tetrahedral must satisfy the binomial coefficient equation:

The following are the only numbers that are both Tetrahedral and Triangular numbers:

*Tetrahedron*_{1} = *Triangle*_{1} = 1

*Tetrahedron*_{3} = *Triangle*_{4} = 10

*Tetrahedron*_{8} = *Triangle*_{15} = 120

*Tetrahedron*_{20} = *Triangle*_{55} = 1540

*Tetrahedron*_{34} = *Triangle*_{119} = 7140