Hexagonal Number

A hexagonal number is a figurate number. The ''n''th hexagonal number ''h''_''n'' is the number of ''distinct'' dots in a pattern of dots consisting of the ''outlines'' of regular hexagons with sides up to n dots, when the hexagons are overlaid so that they share one vertex.

The formula for the ''n''th hexagonal number

:$h_n= 2n^2-n = n(2n-1) = \frac.$

The first few hexagonal numbers are:

: 1, 6, 15, 28, 45, 66, 91, 120, 153, 190, 231, 276, 325, 378, 435, 496, 561, 630, 703, 780, 861, 946...

Every hexagonal number is a triangular number, but only every ''other'' triangular number (the 1st, 3rd, 5th, 7th, etc.) is a hexagonal number. Like a triangular number, the digital root in base 10 of a hexagonal number can only be 1, 3, 6, or 9. The digital root pattern, repeating every nine terms, is "1 6 6 1 9 3 1 3 9".

Every even perfect number is hexagonal, given by the formula
:$M_p 2^ = M_p \frac = h_=h_$
:where ''M''_''p'' is a Mersenne prime. No odd perfect numbers are known, hence all known perfect numbers are hexagonal.
:For example, the 2nd hexagonal number is 2×3 = 6; the 4th is 4×7 = 28; the 16th is 16×31 = 496; and the 64th is 64×127 = 8128.

The largest number that cannot be written as a sum of at most four hexagonal numbers is 130. Adrien-Marie Legendre proved in 1830 that any integer greater than 1791 can be expressed in this way.

In addition, only two integers cannot be expressed using five hexagonal numbers (but can be with six), those being 11 and 26.

Hexagonal numbers should not be confused with centered hexagonal numbers, which model the standard packaging of Vienna sausages. To avoid ambiguity, hexagonal numbers are sometimes called "cornered hexagonal numbers".

Test for hexagonal numbers

One can efficiently test whether a positive integer ''x'' is a hexagonal number by computing

:$n = \frac.$

If ''n'' is an integer, then ''x'' is the ''n''th hexagonal number. If ''n'' is not an integer, then ''x'' is not hexagonal.

Congruence relations

* $h_n \equiv n \pmod$
* $h_+h_+h_ \equiv 0 \pmod$

Other properties

Expression using sigma notation

The ''n''th number of the hexagonal sequence can also be expressed by using sigma notation as

:$h_n = \sum_^$

where the empty sum is taken to be 0.

Sum of the reciprocal hexagonal numbers

The sum of the reciprocal hexagonal numbers is , where denotes natural logarithm.
:\begin \sum_^ \frac &= \lim_2\sum_^ \left(\frac - \frac \right)\\ &= \lim_2\sum_^ \left(\frac + \frac - \frac \right)\\ &= 2 \lim_\left(\sum_^\frac - \sum_^\frac\right)\\ &= 2 \lim_\sum_^\frac \\ &= 2 \lim_\frac\sum_^\frac\\ &= 2 \int_^\fracdx \\ &= 2 \ln(1+x) ^ \\ &= 2 \ln\\
& \approx
\end

Multiplying the index

Using rearrangement, the next set of formulas is given:

$h_ = 4h_n+2n$

$h_ = 9h_n+6n$

$...$

$h_ = m^h_n+(m^-m)n$

Ratio relation

Using the final formula from before with respect to ''m'' and then ''n'', and then some reducing and moving, one can get to the following equation:

$\frac=\left(\frac\right)^2$

Numbers of divisors of powers of certain natural numbers

$12^$ for ''n''>0 has $h_n$ divisors.

Likewise, for any natural number of the form $r = p^2 q$ where ''p'' and ''q'' are distinct prime numbers, $r^$ for ''n''>0 has $h_n$ divisors.

''Proof.'' $r^ = (p^2 q)^ = p^ q^$
has divisors of the form $p^k q^l$, for ''k'' = 0 ... 2(''n'' − 1), ''l'' = 0 ... n − 1. Each combination of ''k'' and ''l'' yields a distinct divisor, so $r^$ has (n - 1) + 1 n - 1) + 1/math> divisors, i.e. $(2n - 1) n = h_n$ divisors. ∎

Hexagonal square numbers

The sequence of numbers that are both hexagonal and perfect squares starts 1, 1225, 1413721,... .

See also

*Centered hexagonal number

External links

*

{{series (mathematics)

Figurate numbers