Euler numbers

For other uses, see List of things named after Leonhard Euler § Euler—numbers.

In number theory, the Euler numbers are a sequence E_n of integers (sequence A122045 in the OEIS) defined by the following Taylor series expansion:

${\frac {1}{\cosh t}}={\frac {2}{e^{t}+e^{-t}}}=\sum _{n=0}^{\infty }{\frac {E_{n}}{n!}}\cdot t^{n}\!$

where cosh t is the hyperbolic cosine. The Euler numbers appear as a special value of the Euler polynomials.

The odd-indexed Euler numbers are all zero. The even-indexed ones (sequence A028296 in the OEIS) have alternating signs. Some values are:

E₀ = 1

E₂ = −1

E₄ = 5

E₆ = −61

E₈ = 1,385

E₁₀ = −50,521

E₁₂ = 2,702,765

E₁₄ = −199,360,981

E₁₆ = 19,391,512,145

E₁₈ = −2,404,879,675,441

Some authors re-index the sequence in order to omit the odd-numbered Euler numbers with value zero, and/or change all signs to positive. This encyclopedia adheres to the convention adopted above.

The Euler numbers appear in the Taylor series expansions of the secant and hyperbolic secant functions. The latter is the function in the definition. They also occur in combinatorics, specifically when counting the number of alternating permutations of a set with an even number of elements.

Explicit formulas

Iterated sum

An explicit formula for Euler numbers is given by:

$E_{2n}=i\sum _{k=1}^{2n+1}\sum _{j=0}^{k}{k \choose j}{\frac {(-1)^{j}(k-2j)^{2n+1}}{2^{k}i^{k}k}}$

where i denotes the imaginary unit with i²=−1.

Sum over partitions

The Euler number E_2n can be expressed as a sum over the even partitions of 2n,

$E_{2n}=(2n)!\sum _{0\leq k_{1},\ldots ,k_{n}\leq n}~\left({\begin{array}{c}K\\k_{1},\ldots ,k_{n}\end{array}}\right)\delta _{n,\sum mk_{m}}\left({\frac {-1~}{2!}}\right)^{k_{1}}\left({\frac {-1~}{4!}}\right)^{k_{2}}\cdots \left({\frac {-1~}{(2n)!}}\right)^{k_{n}},$

as well as a sum over the odd partitions of 2n − 1,

$E_{2n}=(-1)^{n-1}(2n-1)!\sum _{0\leq k_{1},\ldots ,k_{n}\leq 2n-1}\left({\begin{array}{c}K\\k_{1},\ldots ,k_{n}\end{array}}\right)\delta _{2n-1,\sum (2m-1)k_{m}}\left({\frac {-1~}{1!}}\right)^{k_{1}}\left({\frac {1}{3!}}\right)^{k_{2}}\cdots \left({\frac {(-1)^{n}}{(2n-1)!}}\right)^{k_{n}},$

where in both cases $K=k_{1}+\cdots +k_{n}$ and

$\left({\begin{array}{c}K\\k_{1},\ldots ,k_{n}\end{array}}\right)\equiv {\frac {K!}{k_{1}!\cdots k_{n}!}}$

is a multinomial coefficient. The Kronecker delta's in the above formulas restrict the sums over the k's to $2k_{1}+4k_{2}+\cdots +2nk_{n}=2n$ and to $k_{1}+3k_{2}+\cdots +(2n-1)k_{n}=2n-1$, respectively.

As an example,

${\begin{aligned}E_{10}&=10!\left(-{\frac {1}{10!}}+{\frac {2}{2!8!}}+{\frac {2}{4!6!}}-{\frac {3}{2!^{2}6!}}-{\frac {3}{2!4!^{2}}}+{\frac {4}{2!^{3}4!}}-{\frac {1}{2!^{5}}}\right)\\&=9!\left(-{\frac {1}{9!}}+{\frac {3}{1!^{2}7!}}+{\frac {6}{1!3!5!}}+{\frac {1}{3!^{3}}}-{\frac {5}{1!^{4}5!}}-{\frac {10}{1!^{3}3!^{2}}}+{\frac {7}{1!^{6}3!}}-{\frac {1}{1!^{9}}}\right)\\&=-50,521.\end{aligned}}$

Determinant

E_2n is also given by the determinant

${\begin{aligned}E_{2n}&=(-1)^{n}(2n)!~{\begin{vmatrix}{\frac {1}{2!}}&1&~&~&~\\{\frac {1}{4!}}&{\frac {1}{2!}}&1&~&~\\\vdots &~&\ddots ~~&\ddots ~~&~\\{\frac {1}{(2n-2)!}}&{\frac {1}{(2n-4)!}}&~&{\frac {1}{2!}}&1\\{\frac {1}{(2n)!}}&{\frac {1}{(2n-2)!}}&\cdots &{\frac {1}{4!}}&{\frac {1}{2!}}\end{vmatrix}}.\end{aligned}}$

Asymptotic approximation

The Euler numbers grow quite rapidly for large indices as they have the following lower bound

$|E_{2n}|>8{\sqrt {\frac {n}{\pi }}}\left({\frac {4n}{\pi e}}\right)^{2n}.$

See also

• Bernoulli number
• Bell number

External links

• Weisstein, Eric W. "Euler number". MathWorld.
• Euler numbers calculator
• Euler number (first 10000 digits)