Related papers: A prime sum involving Bernoulli numbers
We reduce the calculation of the simplest Hodge integrals to some sums over decorated trees. Since Hodge integrals are already calculated, this gives a proof of a rather interesting combinatorial theorem and a new representation of…
The Bernoulli numbers b_0,b_1,b_2,.... of the second kind are defined by \sum_{n=0}^\infty b_nt^n=\frac{t}{\log(1+t)}. In this paper, we give an explicit formula for the sum \sum_{j_1+j_2+...+j_N=n,…
We present a variety of prime-generating constructions that are based on sums of primes. The constructions come in all shapes and sizes, varying in the number of dimensions and number of generated primes. Our best result is a construction…
In this paper, we find an elementary approach for double sums where the inner sum is binomial but incomplete. We apply our core identity and its relatives to double sums involving famous numbers such as harmonic numbers, Fibonacci numbers,…
The Stirling numbers of the first kind can be represented in terms of a new class of polynomials that are closely related to the Bernoulli polynomials. Recursion relations for these polynomials are given.
In this paper, we exploit the r-Stirling numbers of both kinds in order to give explicit formulae for the values of the high order Bernoulli numbers and polynomials of both kinds at integers. We give also some identities linked the…
In this paper, we consider the degenerate poly-Bernoulli polynomials and present new and explicit formulas for computing them in terms of the degenerate Bernoulli polynomials and Stirling numbers of the second kind.
We prove explicit bounds for the number of sums of consecutive prime squares below a given magnitude.
This paper shows that a finite discrete convolution involving Stirling numbers of both kinds and harmonic numbers can be expressed in terms of the Bernoulli numbers. As applications of this expression, the linear recurrence relation for the…
In the paper, the authors find two closed forms involving the Stirling numbers of the second kind and in terms of a determinant of combinatorial numbers for the Bernoulli polynomials and numbers.
A sequence of rational numbers as a generalization of the sequence of Bernoulli numbers is introduced. Sums of products involving the terms of this generalized sequence are then obtained using an application of the Fa\`a di Bruno's formula.…
In this paper, we continue our investigation of double sums where the inner sum is binomial but incomplete. We prove many new results for these types of double sums associated with binomial transform pairs. As applications we deduce new…
A few elementary estimates of a basic character sum over the prime numbers are derived here. These estimates are nontrivial for character sums modulo large q. In addition, an omega result for character sums over the primes is also included.
This paper is devoted to establishing several new formulas relating Bernoulli and Stirling numbers of both kinds.
The main object of this paper is to find closed form expressions for finite and infinite sums that are weighted by $\omega(n)$, where $\omega(n)$ is the number of distinct prime factors of $n$. We then derive general convergence criteria…
In this work we introduce a new polynomial representation of the Bernoulli numbers in terms of polynomial sums allowing on the one hand a more detailed understanding of their mathematical structure and on the other hand provides a…
In this note we generalise a method of Perott to give new proofs that there are infinitely many prime numbers.
We present a relationship between the generalized hyperharmonic numbers and the poly-Bernoulli polynomials, motivated from the connections between harmonic and Bernoulli numbers. This relationship yields numerous identities for the…
We consider the representation of primes as a sum of a prime and twice a triangular number. We prove that a subset of the primes having density 1 is expressible in this form. We conjecture that every odd prime number is expressible as a sum…
In the paper, the authors establish an explicit formula for computing Bernoulli polynomials at non-negative integer points in terms of $r$-Stirling numbers of the second kind.