Pentatope number

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search
Derivation of Pentatope number from a left-justified Pascal's triangle

A pentatope number is a number in the fifth cell of any row of Pascal's triangle starting with the 5-term row 1 4 6 4 1 either from left to right or from right to left.

The first few numbers of this kind are :

1, 5, 15, 35, 70, 126, 210, 330, 495, 715, 1001, 1365 (sequence A000332 in the OEIS)
A pentatope with side length 5 contains 70 3-spheres. Each layer represents one of the first five tetrahedral numbers. For example, the bottom (green) layer has 35 spheres in total.

Pentatope numbers belong in the class of figurate numbers, which can be represented as regular, discrete geometric patterns.[1] The formula for the nth pentatopic number is:

Two of every three pentatope numbers are also pentagonal numbers. To be precise, the (3k − 2)th pentatope number is always the ((3k2 − k)/2)th pentagonal number and the (3k − 1)th pentatope number is always the ((3k2 + k)/2)th pentagonal number. The 3kth pentatope number is the generalized pentagonal number obtained by taking the negative index −(3k2 + k)/2 in the formula for pentagonal numbers. (These expressions always give integers).[2]

The infinite sum of the reciprocals of all pentatopal numbers is .[3] This can be derived using telescoping series.

Pentatopal numbers can also be represented as the sum of the first n tetrahedral numbers.[2]In biochemistry, they represent the number of possible arrangements of n different polypeptide subunits in a tetrameric (tetrahedral) protein. No prime is the predecessor of a pentatope number, and the largest semiprime which is the predecessor of a pentatope number is 1819.

Similarly, the only primes preceding a 6-simplex number are 83 and 461.

Test for pentatope numbers[edit]

is triangular number.

then : is perfect square.


  1. ^ Deza, Elena; Deza, M. (2012), "3.1 Pentatope numbers and their multidimensional analogues", Figurate Numbers, World Scientific, p. 162, ISBN 9789814355483
  2. ^ a b Sloane, N. J. A. (ed.). "Sequence A000332". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  3. ^ Rockett, Andrew M. (1981), "Sums of the inverses of binomial coefficients" (PDF), Fibonacci Quarterly, 19 (5): 433–437. Theorem 2, p. 435.