A pentagonal number is a figurate number that extends the concept of triangular and square numbers to the pentagon, but, unlike the first two, the patterns involved in the construction of pentagonal numbers are not rotationally symmetrical. The nth pentagonal number pn is the number of distinct dots in a pattern of dots consisting of the outlines of regular pentagons with sides up to n dots, when the pentagons are overlaid so that they share one vertex. For instance, the third one is formed from outlines comprising 1, 5 and 10 dots, but the 1, and 3 of the 5, coincide with 3 of the 10 – leaving 12 distinct dots, 10 in the form of a pentagon, and 2 inside.
pn is given by the formula:
for n ≥ 1. The first few pentagonal numbers are:
The nth pentagonal number is one third of the 3n-1th triangular number.
Generalized pentagonal numbers are obtained from the formula given above, but with n taking values in the sequence 0, 1, -1, 2, -2, 3, -3, 4..., producing the sequence:
0, 1, 2, 5, 7, 12, 15, 22, 26, 35, 40, 51, 57, 70, 77, 92, 100, 117, 126, 145, 155, 176, 187, 210, 222, 247, 260, 287, 301, 330, 345, 376, 392, 425, 442, 477, 495, 532, 551, 590, 610, 651, 672, 715, 737, 782, 805, 852, 876, 925, 950, 1001, 1027, 1080, 1107, 1162, 1190, 1247, 1276, 1335... (sequence A001318 in OEIS).
The number of dots inside the outermost pentagon of a pattern forming a pentagonal number is itself a generalized pentagonal number.
Pentagonal numbers should not be confused with centered pentagonal numbers.
Generalized pentagonal numbers are closely related to centered hexagonal numbers. When the array corresponding to a centered hexagonal number is divided between its middle row and an adjacent row, it appears as the sum of two generalized pentagonal numbers, with the larger piece being a pentagonal number proper:
where both terms on the right are generalized pentagonal numbers and the first term is a pentagonal number proper (n ≥ 1). This division of centered hexagonal arrays gives generalized pentagonal numbers as trapezoidal arrays, which may be interpreted as Ferrers diagrams for their partition. In this way they can be used to prove the pentagonal number theorem referenced above.
The simplest way to test whether a positive integer x is a (non-generalized) pentagonal number is by computing
If n is a natural number, then x is the nth pentagonal number. If n is not a natural number, then x is not pentagonal.
For generalized pentagonal numbers, it is sufficient to just check if
- is a perfect square.
For non-generalized pentagonal numbers, in addition to the perfect square test, it is also required to check if
The mathematical properties of Pentagonal numbers ensure that these tests are sufficient for proving or disproving the pentagonality of a number.1