In mathematics, the Euler numbers are a sequence "En" of integers defined by the Taylor series expansion formula_1, where formula_2 is the hyperbolic cosine function. The Euler numbers are related to a special value of the Euler polynomials, namely: formula_3 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. Examples. The odd-indexed Euler numbers are all zero. The even-indexed ones have alternating signs. Some values are: Some authors re-index the sequence in order to omit the odd-numbered Euler numbers with value zero, or change all signs to positive . This article adheres to the convention adopted above. Explicit formulas. In terms of Stirling numbers of the second kind. The following two formulas express the Euler numbers in terms of Stirling numbers of the second kind: formula_4 formula_5 where formula_6 denotes the Stirling numbers of the second kind, and formula_7 denotes the rising factorial. As a recursion. The Euler numbers can be defined as an recursion: formula_8 or alternatively: formula_9 Both of these recursions can be found by using the fact that. formula_10 As a double sum. The following two formulas express the Euler numbers as double sums formula_11 formula_12 As an iterated sum. An explicit formula for Euler numbers is: formula_13 where denotes the imaginary unit with . As a sum over partitions. The Euler number can be expressed as a sum over the even partitions of , formula_14 as well as a sum over the odd partitions of , formula_15 where in both cases and formula_16 is a multinomial coefficient. The Kronecker deltas in the above formulas restrict the sums over the s to and to , respectively. As an example, formula_17 As a determinant. is given by the determinant formula_18 As an integral. is also given by the following integrals: formula_19 Congruences. W. Zhang obtained the following combinational identities concerning the Euler numbers. For any prime formula_20, we have formula_21 W. Zhang and Z. Xu proved that, for any prime formula_22 and integer formula_23, we have formula_24 where formula_25 is the Euler's totient function. Lower bound. The Euler numbers grow quite rapidly for large indices, as they have the lower bound formula_26 Euler zigzag numbers. The Taylor series of formula_27 is formula_28 where is the Euler zigzag numbers, beginning with 1, 1, 1, 2, 5, 16, 61, 272, 1385, 7936, 50521, 353792, 2702765, 22368256, 199360981, 1903757312, 19391512145, 209865342976, 2404879675441, 29088885112832, ... For all even , formula_29 where is the Euler number, and for all odd , formula_30 where is the Bernoulli number. For every "n", formula_31