Some Properties of Generalized Euler Numbers
David J. Leeming, R. A. Macleod
Abstract
Open-access reader
David J. Leeming, R. A. Macleod
Abstract
Open-access reader
We define infinitely many sequences of integers one sequence for each positive integer k ≦ 2 by (1.1) where are the k-th roots of unity and (E(k))n is replaced by En(k) after multiplying out. An immediate consequence of (1.1) is (1.2) Therefore, we are interested in numbers of the form Esk(k) (s = 0, 1, 2, …; k = 2, 3, …). Some special cases have been considered in the literature. For k = 2, we obtain the Euler numbers (see e.g. [8]). The case k = 3 is considered briefly by D. H. Lehmer [7], and the case k = 4 by Leeming [6] and Carlitz ([1]and [2]).
OpenAlex reports 9 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
We define infinitely many sequences of integers one sequence for each positive integer k ≦ 2 by (1.1) where are the k-th roots of unity and (E(k))n is replaced by En(k) after multiplying out. An immediate consequence of (1.1) is (1.2) Therefore, we are interested in numbers of the form Esk(k) (s = 0, 1, 2, …; k = 2, 3, …). Some special cases have been considered in the literature. For k = 2, we obtain the Euler numbers (see e.g. [8]). The case k = 3 is considered briefly by D. H. Lehmer [7], and the case k = 4 by Leeming [6] and Carlitz ([1]and [2]).
Key concepts: Mathematics, Euler's formula, Sequence (biology), Integer (computer science), Euler number (physics), Combinatorics, Discrete mathematics, Pure mathematics