Computation of tangent, Euler, and Bernoulli numbers

Abstract

Abstract. Some elementary methods are described which may be used to calculate tangent numbers, Euler numbers, and Bernoulli numbers much more easily and rapidly on electronic computers than the traditional recurrence relations which have been used for over a century. These methods have been used to prepare an accompanying table which extends the existing tables of these numbers. Some theorems about the periodicity of the tangent numbers, which were suggested by the tables, are also proved.

On the Success of Electromagnetic Analytical Approaches to Full Time-Domain Formulation of Skin Effect Phenomena

“…where the numbers E n in S 2 are the so-called Euler numbers [28]. The summation S 1 is absolutely convergent for −∞ < x < ∞.…”

Computing prime harmonic sums

“…With the method given by Knuth and Buckholtz [17], we can compute the first ν Bernoulli numbers to precision using O(ν 2 log + ν 2 ) bit operations [4]. (Furthermore, the space is O(ν ).)…”

Dynamical zeta functions and Kummer congruences

“…With b n = −24, the numbers A n are given by Ramanujan's τ function, A n = τ (n + 1). Finally, let (T n ) be the tangent numbers of [7]:…”