Euler Numbers Table Calculator

Euler Numbers Table Calculator

Emerging AI Skill PRO

Enter Calculation

Formula

En={1n=00n odd−∑k=0m−1(2m2k)E2kn=2m,m≥1E_{\text{n}}^{\,{}} = \begin{cases} 1 & n = 0 \\[0.4em] 0 & n \text{ odd} \\[0.4em] -\displaystyle\sum_{k=0}^{m-1} \binom{2m}{2k}\, E_{2k} & n = 2m,\ m \ge 1 \end{cases}
Usage stats

Advertisement

Results

Euler numbers Eₙ
21
values (n = 0 … 20)
n Eₙ
0 1
1 0
2 -1
3 0
4 5
5 0
6 -61
7 0
8 1385
9 0
10 -50521
11 0
12 2702765
13 0
14 -199360981
15 0
16 19391512145
17 0
18 -2404879675441
19 0
20 370371188237525

All odd-index Euler numbers are exactly 0; only even-index values are nonzero. Signs alternate: E₀=1, E₂=-1, E₄=5, E₆=-61.

Report an error on this page

What are the Euler numbers?

The Euler numbers Eₙ are a famous integer sequence that appears in the Taylor expansion of the hyperbolic secant 1/cosh(x). They are sometimes called the secant numbers (up to sign). This is pure mathematics and applies identically everywhere — there is no region-specific rule. This tool prints a table of Eₙ for any index range you choose.

Flat bar chart of the first several nonzero Euler numbers with alternating signs
The nonzero Euler numbers alternate in sign and grow rapidly in magnitude.

How to use it

Enter the start (nMin) and end (nMax) of the ordinal range, then pick a display precision in significant digits. The calculator lists every integer index n from nMin to nMax inclusive together with its Euler number. Because the values grow super-exponentially, exact big-integer arithmetic is used internally and very large numbers are shown in scientific notation.

The formula

The generating function is \( \frac{1}{\cosh(x)} = \sum E_n / n! \cdot x^n \). All odd-index Euler numbers are exactly zero. The even-index numbers follow the exact recurrence:

$$E_0 = 1, \text{ and for } m \ge 1: E_{2m} = -\sum_{k=0}^{m-1} \binom{2m}{2k} \cdot E_{2k}.$$

The signs alternate automatically: \(E_0 = 1\), \(E_2 = -1\), \(E_4 = 5\), \(E_6 = -61\), \(E_8 = 1385\).

Advertisement
Flat curve of the hyperbolic secant function sech x bell shape
Euler numbers are the Taylor coefficients of the generating function \( 1/\cosh x \).

Worked example

For nMin = 0, nMax = 8 the table contains 9 rows: \(n=0 \rightarrow 1\), \(n=1 \rightarrow 0\), \(n=2 \rightarrow -1\), \(n=3 \rightarrow 0\), \(n=4 \rightarrow 5\), \(n=5 \rightarrow 0\), \(n=6 \rightarrow -61\), \(n=7 \rightarrow 0\), \(n=8 \rightarrow 1385\).

Reference Table of Euler Numbers E0 to E20

The Euler numbers \(E_n\) are the integers defined by the expansion \(\operatorname{sech} x = \sum_{n\ge 0} E_n \dfrac{x^n}{n!}\). All odd-index values are 0, so the table lists only even \(n\). The values below are exact integers and use the convention \(E_0 = 1\), \(E_2 = -1\).

n En |En| (secant number)
0 1 1
2 -1 1
4 5 5
6 -61 61
8 1385 1385
10 -50521 50521
12 2702765 2702765
14 -199360981 199360981
16 19391512145 19391512145
18 -2404879675441 2404879675441
20 370371188237525 370371188237525

Every odd index (\(E_1, E_3, E_5, \dots\)) equals 0. The absolute values \(|E_{2m}|\) are the secant numbers 1, 1, 5, 61, 1385, 50521, …, which are the coefficients of \(\sec x = \sum_{m\ge0} |E_{2m}| \dfrac{x^{2m}}{(2m)!}\).

How to Compute Euler Numbers by Hand

Multiplying \(\operatorname{sech} x\) by \(\cosh x\) gives 1, and comparing coefficients yields the recurrence used by the calculator:

$$E_{2m} = -\sum_{k=0}^{m-1} \binom{2m}{2k} E_{2k}, \qquad E_0 = 1,\; E_{\text{odd}} = 0.$$

  1. Start: \(E_0 = 1\).
  2. Compute E2 (m = 1): only \(k=0\) contributes, so \(E_2 = -\binom{2}{0}E_0 = -(1\cdot 1) = -1\).
  3. Compute E4 (m = 2): \(E_4 = -\left(\binom{4}{0}E_0 + \binom{4}{2}E_2\right) = -(1\cdot 1 + 6\cdot(-1)) = -(1-6) = 5\).
  4. Compute E6 (m = 3): the binomials are \(\binom{6}{0}=1\), \(\binom{6}{2}=15\), \(\binom{6}{4}=15\), so \(E_6 = -(1\cdot 1 + 15\cdot(-1) + 15\cdot 5) = -(1 - 15 + 75) = -61\).
  5. Continue (optional check, E8): with \(\binom{8}{0}=1,\ \binom{8}{2}=28,\ \binom{8}{4}=70,\ \binom{8}{6}=28\): \(E_8 = -(1 - 28 + 350 - 1708) = -(-1385) = 1385\).

Sign alternation: the signs follow \(\operatorname{sign}(E_{2m}) = (-1)^m\), so \(E_{2m} = (-1)^m |E_{2m}|\). This is a handy check on each step of the hand calculation.

Advertisement

Interpreting the Table: Growth and Sign Pattern

Sign pattern. Even-index values alternate: \(E_0 > 0,\ E_2 < 0,\ E_4 > 0,\dots\), that is \(\operatorname{sign}(E_{2m}) = (-1)^m\). Odd-index entries are always 0.

Growth. The numbers grow faster than exponentially, roughly like a factorial. A standard asymptotic form is

$$|E_{2m}| \sim 8\sqrt{\frac{m}{\pi}}\left(\frac{4m}{\pi e}\right)^{2m},$$

and an equivalent, simpler approximation is

$$|E_{2m}| \approx \frac{2^{2m+2}\,(2m)!}{\pi^{2m+1}}.$$

Check: for \(m=3\), \(2^{8}\cdot 720/\pi^{7} \approx 61.03\), close to the exact 61. For \(m=2\) it gives about 5.02 versus the exact 5. The ratio of the approximation to the exact value tends to 1 very quickly as \(m\) increases.

Related objects. The absolute values \(|E_{2m}|\) are the secant numbers, which count alternating (up/down) permutations of an even number of elements. The Euler numbers are also tied to the Euler polynomials by \(E_n = 2^n E_n(1/2)\).

Displayed significant digits. The table is computed with exact big-integer arithmetic, so each \(E_n\) is exact whatever the setting. The significant-digits option only changes how large values are shown (for example rounded in scientific notation). It never changes the underlying integer or the sign.

FAQ

Why are odd entries always 0? Because \( 1/\cosh(x) \) is an even function, so only even powers of x appear in its expansion.

Are these the same as Euler's number e? No. Euler's number \( e \approx 2.71828 \) is unrelated; these are integers from the secant generating function.

How large can the range be? nMax is capped at 100. The values are computed exactly with big integers, so no precision is lost.

Last updated:

Most popular in Math and Statistics

View all Math and Statistics calculators