Related papers: New recurrences for divisor sum functions and tria…
The partitions of the integers can be expressed exactly in an iterative and closed-form expression. This equation is derived from distributing the partitions of a number in a network that locates each partition in a unique and orderly…
Koecher in 1980 derived a method for obtaining identities for the Riemann zeta function at odd positive integers, including a classical result for $\zeta(3)$ due to Markov and rediscovered by Ap\'ery. In this paper we extend Koecher's…
Euler evaluates the integrals in the title and recognizes a recursion between them, which he then uses to give continued fractions for the log and arctan. The paper is translated from Euler's Latin original into German.
In this paper, we obtain some formulas for double nonlinear Euler sums involving harmonic numbers and alternating harmonic numbers. By using these formulas, we give new closed form sums of several quadratic Euler series through Riemann zeta…
In 1776, L. Euler proposed three methods, called prima methodus, secunda methodus and tertia methodus, to calculate formulae for double zeta values. However strictly speaking, his last two methods are mathematically incomplete and require…
We show that an apparently overlooked result of Euler from \cite{E421} is essentially equivalent to the general multiplication formula for the $\Gamma$-function that was proven by Gauss in \cite{Ga28}.
Let $$\lambda(s)=\sum_{n=0}^\infty\frac1{(2n+1)^s},$$ $$\beta(s)=\sum_{n=0}^\infty\frac{(-1)^{n}}{(2n+1)^s},$$ and $$\eta(s)=\sum_{n=1}^\infty\frac{(-1)^{n-1}}{n^s}$$ be the Dirichlet lambda function, its alternating form, and the Dirichlet…
The double zeta function is a function of two arguments defined by a double Dirichlet series, and was first studied by Euler in response to a letter from Goldbach in 1742. By calculating many examples, Euler inferred a closed form…
Euler investigates the Taylorseries of (1+x+xx)^n and uses the results to evaluates some integrals which are today often proved with the calculus of residues.
This paper treats about one of the most remarkable achievements by Riemann, that is the symmetric form of the functional equation for {\zeta}(s). We present here, after showing the first proof of Riemann, a new, simple and direct proof of…
We will use analytic function theory and Fourier analysis to establish a characterization for some classical umbral calculus, which will focus on the generalization of the evaluation function. Although we cannot cover all the umbral…
Recently, the higher-order q-Euler polynomials and multiple q-Euler zeta functions are introduced by T. Kim ([8, 9]). In this paper, we investigate some symmetric properties of the multiple q-Euler zeta function and derive various…
Let $\{B_n\}$, $\{B_n(x)\}$ and $\{E_n(x)\}$ be the Bernoulli numbers, Bernoulli polynomials and Euler polynomials, respectively. In this paper we mainly establish formulas for $\sum_{6\mid k-3}\binom nkB_{n-k}(x)$, $\sum_{6\mid k}\binom…
This study presents miscellaneous properties of pseudo-factorials, which are numbers whose recurrence relation is a twisted form of that of usual factorials. These numbers are associated with special elliptic functions, most notably, a…
We give conditions for when two Euler products are the same given that they satisfy a functional equation and their coefficients are not too large and do not differ from each other by too much. Additionally, we prove a number of…
Resurgence Theory and Mould Calculus were invented by J. Ecalle around 1980 in the context of analytic dynamical systems and are increasingly more used in the mathematical physics community, especially since the 2010s. We review the…
Certain generalization of Euler numbers was defined in 1935 by Lehmer using cubic roots of unity, as a natural generalization of Bernoulli and Euler numbers. In this paper, we define a new polynomial related to the higher-order generalized…
The Eulerian numbers form a triangular array with many interesting properties. The numbers arise from various combinatorial and probabilistic interpretations, and have been studied in a variety of mathematical contexts. In this article we…
Glaisher's theorem states that the number of partitions of $n$ into parts which repeat at most $m-1$ times is equal to the number of partitions of $n$ into parts which are not divisible by $m$. The $m=2$ case is Euler's famous partition…
We consider a family of integer sequences generated by nonlinear recurrences of the second order, which have the curious property that the terms of the sequence, and integer multiples of the ratios of successive terms (which are also…