Computation of tangent, Euler, and Bernoulli numbers

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.