Pronic number

A pronic number is a number that is the product of two consecutive integers, that is, a number of the form $$n(n+1)$$. The study of these numbers dates back to Aristotle. They are also called oblong numbers, heteromecic numbers, or rectangular numbers; however, the term "rectangular number" has also been applied to the composite numbers.

The first few pronic numbers are:


 * 0, 2, 6, 12, 20, 30, 42, 56, 72, 90, 110, 132, 156, 182, 210, 240, 272, 306, 342, 380, 420, 462 ….

Letting $$P_n$$ denote the pronic number $$n(n+1)$$, we have $$P_{{-}n} = P_{n{-}1}$$. Therefore, in discussing pronic numbers, we may assume that $$n\geq 0$$ without loss of generality, a convention that is adopted in the following sections.

As figurate numbers


The pronic numbers were studied as figurate numbers alongside the triangular numbers and square numbers in Aristotle's Metaphysics, and their discovery has been attributed much earlier to the Pythagoreans. As a kind of figurate number, the pronic numbers are sometimes called oblong because they are analogous to polygonal numbers in this way:


 * {| style="text-align: center"


 * - valign="bottom"
 * style="padding: 0 1em"|[[Image:GrayDot.svg|16px|*]] [[Image:GrayDot.svg|16px|*]]
 * style="padding: 0 1em"|[[Image:GrayDot.svg|16px|*]] [[Image:GrayDot.svg|16px|*]] [[Image:GrayDot.svg|16px|*]] [[Image:GrayDot.svg|16px|*]] [[Image:GrayDot.svg|16px|*]] [[Image:GrayDot.svg|16px|*]]
 * style="padding: 0 1em"|[[Image:GrayDot.svg|16px|*]] [[Image:GrayDot.svg|16px|*]] [[Image:GrayDot.svg|16px|*]] [[Image:GrayDot.svg|16px|*]] [[Image:GrayDot.svg|16px|*]] [[Image:GrayDot.svg|16px|*]] [[Image:GrayDot.svg|16px|*]] [[Image:GrayDot.svg|16px|*]] [[Image:GrayDot.svg|16px|*]] [[Image:GrayDot.svg|16px|*]] [[Image:GrayDot.svg|16px|*]] [[Image:GrayDot.svg|16px|*]]
 * style="padding: 0 1em"|[[Image:GrayDot.svg|16px|*]] [[Image:GrayDot.svg|16px|*]] [[Image:GrayDot.svg|16px|*]] [[Image:GrayDot.svg|16px|*]] [[Image:GrayDot.svg|16px|*]] [[Image:GrayDot.svg|16px|*]] [[Image:GrayDot.svg|16px|*]] [[Image:GrayDot.svg|16px|*]] [[Image:GrayDot.svg|16px|*]] [[Image:GrayDot.svg|16px|*]] [[Image:GrayDot.svg|16px|*]] [[Image:GrayDot.svg|16px|*]] [[Image:GrayDot.svg|16px|*]] [[Image:GrayDot.svg|16px|*]] [[Image:GrayDot.svg|16px|*]] [[Image:GrayDot.svg|16px|*]] [[Image:GrayDot.svg|16px|*]] [[Image:GrayDot.svg|16px|*]] [[Image:GrayDot.svg|16px|*]] [[Image:GrayDot.svg|16px|*]]
 * 1&thinsp;× 2||2 × 3||3 × 4||4 × 5
 * }
 * }

The $n$th pronic number is the sum of the first $n$ even integers, and as such is twice the $n$th triangular number and $n$ more than the $n$th square number, as given by the alternative formula $n^{2} + n$ for pronic numbers. The $n$th pronic number is also the difference between the odd square $(2n + 1)^{2}$ and the $(n+1)$st centered hexagonal number.

Since the number of off-diagonal entries in a square matrix is twice a triangular number, it is a pronic number.

Sum of pronic numbers
The partial sum of the first $n$ positive pronic numbers is twice the value of the $n$th tetrahedral number:
 * $$\sum_{k=1}^{n} k(k+1) =\frac{n(n+1)(n+2)}{3}= 2T_n $$.

The sum of the reciprocals of the positive pronic numbers (excluding 0) is a telescoping series that sums to 1:
 * $$\sum_{i=1}^{\infty} \frac{1}{i(i+1)}=\frac{1}{2}+\frac{1}{6}+\frac{1}{12}+\frac{1}{20}\cdots=1$$.

The partial sum of the first $n$ terms in this series is
 * $$\sum_{i=1}^{n} \frac{1}{i(i+1)} =\frac{n}{n+1}$$.

The alternating sum of the reciprocals of the positive pronic numbers (excluding 0) is a convergent series:
 * $$\sum_{i=1}^{\infty} \frac{(-1)^{i+1}}{i(i+1)}=\frac{1}{2}-\frac{1}{6}+\frac{1}{12}-\frac{1}{20}\cdots=\log(4)-1$$.

Additional properties
Pronic numbers are even, and 2 is the only prime pronic number. It is also the only pronic number in the Fibonacci sequence and the only pronic Lucas number.

The arithmetic mean of two consecutive pronic numbers is a square number:
 * $$\frac {n(n+1) + (n+1)(n+2)}{2} = (n+1)^2$$

So there is a square between any two consecutive pronic numbers. It is unique, since
 * $$n^2 \leq n(n+1) < (n+1)^2 < (n+1)(n+2) < (n+2)^2.$$

Another consequence of this chain of inequalities is the following property. If $n$ is a pronic number, then the following holds:
 * $$ \lfloor{\sqrt{m}}\rfloor \cdot \lceil{\sqrt{m}}\rceil = m.$$

The fact that consecutive integers are coprime and that a pronic number is the product of two consecutive integers leads to a number of properties. Each distinct prime factor of a pronic number is present in only one of the factors $n$ or $n + 1$. Thus a pronic number is squarefree if and only if $n$ and $n + 1$ are also squarefree. The number of distinct prime factors of a pronic number is the sum of the number of distinct prime factors of $m$ and $n + 1$.

If 25 is appended to the decimal representation of any pronic number, the result is a square number, the square of a number ending on 5; for example, 625 = 252 and 1225 = 352. This is so because


 * $$100n(n+1) + 25 = 100n^2 + 100n + 25 = (10n+5)^2$$.