Related papers: Euler-type Recurrence Relation for Arbitrary Arith…

The first-order Euler-Maclaurin formula relates the sum of the values of a smooth function on an interval of integers with its integral on the same interval on $\mathbb R$. We formulate here the analogue for functions that are just of…

The partial fraction expansion of coth($\pi$z), due to Euler, is generalized to power series having for coefficients the Riemann zeta function evaluated at certain arithmetic sequences. A further generalization using arbitrary Dirichlet…

We show the recurrence relations of the Euler-Zagier multiple zeta-function which describes the $r$-fold function with one variable specialized to a non-positive integer as a rational linear combination of $(r-1)$-fold functions, which…

In recent work, Hickerson and the author demonstrated that it is useful to think of Appell--Lerch sums as partial theta functions. This notion can be used to relate identities involving partial theta functions with identities involving…

In the spirit of the Head-Gordon-Pople algorithm, we report vertical, transfer and horizontal recurrence relations for the efficient and accurate computation of four-electron integrals over Gaussian basis functions. Our recursive approach…

In this paper we define the generalized q-analogues of Euler sums and present a new family of identities for q-analogues of Euler sums by using the method of Jackson q-integral rep- resentations of series. We then apply it to obtain a…

Let $p_k(n)$ be given by the $k$-th power of the Euler Product $\prod _{n=1}^{\infty}(1-q^n)^k=\sum_{n=0}^{\infty}p_k(n)q^{n}$. By investigating the properties of the modular equations of the second and the third order under the Atkin…

The goal of this paper is to present an algebraic approach to the basic results of the theory of linear recurrence relations. This approach is based on the ideas from the theory of representations of one endomorphisms (a special case of…

We derive recursions for the probability distribution of random sums by computer algebra. Unlike the well-known Panjer-type recursions, they are of finite order and thus allow for computation in linear time. This efficiency is bought by the…

In the study of Dirichlet series with arithmetic significance there has appeared (through the study of known examples) certain expectations, namely (i) if a functional equation and Euler product exists, then it is likely that a type of…

A construction of new sequences of generalized Bernoulli polynomials of first and second kind is proposed. These sequences share with the classical Bernoulli polynomials many algebraic and number--theoretical properties. A new class of…

We believe that Euler constant is not just the "renormalized" value of the Riemann zeta function in 1. In a sense that we shall clarify it is in fact the normal and natural value of zeta of 1. In this paper we first propose a limit…

For positive integers $p_1,p_2,\ldots,p_k,q$ with $q>1$, we define the Euler $T$-sum $T_{p_1p_2\cdots p_k,q}$ as the sum of those terms of the usual infinite series for the classical Euler sum $S_{p_1p_2\cdots p_k,q}$ with odd denominators.…

We prove characterizations of Appell polynomials by means of symmetric property. For these polynomials, we establish a simple linear expression in terms of Bernoulli and Euler polynomials. As applications, we give interesting examples. In…

We show that each member of a doubly infinite sequence of highly nonlinear expressions of Bernoulli polynomials, which can be seen as linear combinations of certain higher-order convolutions, is a multiple of a specific product of linear…

In this paper, we consider sums of values of degenerate falling factorials and give a probabilistic proof of a recurrence relation for them. This may be viewed as a degenerate version of the recent probabilistic proofs on sums of powers of…

We review remarkable results in several mathematical scenarios, including graph theory, division algebras, cross product formalism and matroid theory. Specifically, we mention the following subjects: (1) the Euler relation in graph theory,…

We cover some useful techniques in computational aspects of analytic number theory, with specific emphasis on ideas relevant to the evaluation of L-functions. These techniques overlap considerably with basic methods from analytic number…

In this paper, we investigate recurrence relations for the Maclaurin coefficients of the products of a elementary function and the Bessel function of the first kind $\mathcal{J}(z) = h(z) J_\nu(z)$ and the modified Bessel function of the…

Let us denote by $\tau(n)$ and $\si(n)$ the number and the sum of the divisors of $n$ and by $\vfi$ Euler's function. We give effective upper bounds for $\frac{n}{\vfi(n)}$ in terms of $\vfi(n)$, and for $\frac{\si(n)}{n}$ in terms of…