Related papers: A conjecture about numerators of Bernoulli numbers…
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.
We present a new approach to deal with Fraenkel's conjecture, which describes how the integers can be partitioned into sets of rational Beatty sequences, in the case where the numerators of the moduli are equal. We use this approach to give…
In a recent work, Zielinski used Faulhaber's formula to explain why the odd Bernoulli numbers are equal to zero. Here, we assume that the odd Bernoulli numbers are equal to zero to explain Faulhaber's formula.
In the paper, the authors discover an integral representation, some inequalities, and complete monotonicity of Bernoulli numbers of the second kind.
Poly-Bernoulli numbers are one of generalizations of the classical Bernoulli numbers. Since a negative index poly-Bernoulli number is an integer, it is an interesting problem to study this number from combinatorial viewpoint. In this short…
We derive an expression for the generalized Bernoulli numbers in terms of the Bernoulli numbers involving the (exponential) complete Bell polynomials.
The distribution of the spectral numbers of an isolated hypersurface singularity is studied in terms of the Bernoulli moments. These are certain rational linear combinations of the higher moments of the spectral numbers. They are related to…
Almkvist and Meurman showed that if h and k are integers, then so is $k^n(B_n(h/k) - B_n)$ where $B_n(u)$ is the Bernoulli polynomial. We give here a new and simpler proof of the Almkvist-Meurman theorem using generating functions. We…
We give an expression of polynomials for higher sums of powers of integers via the higher order Bernoulli numbers.
In this note we prove combinatorially some new formulas connecting poly-Bernoulli numbers with negative indices to Eulerian numbers.
We collect here various conjectures on congruences made by the author in a series of papers, some of which involve binary quadratic forms and other advanced theories. Part A consists of 100 unsolved conjectures of the author while…
Poly-Bernoulli numbers $B_n^{(k)}\in\mathbb{Q}$\,($n \geq 0$,\,$k \in \mathbb{Z}$) are defined by Kaneko in 1997. Multi-Poly-Bernoulli numbers\,$B_n^{(k_1,k_2,\ldots, k_r)}$, defined by using multiple polylogarithms, are generations of…
In this paper, we give a short proof of a relation generalizing many identities for Bernoulli numbers.
In the note, the author discovers an explicit formula for computing Bernoulli numbers in terms of Stirling numbers of the second kind.
In this survey paper, I first review the history of Bernoulli numbers, then examine the modern definition of Bernoulli numbers and the appearance of Bernoulli numbers in expansion of functions. I revisit some properties of Bernoulli numbers…
In this paper, we deal with q-Euler numbers and q-Bernoulli numbers. We derive some interesting relations for q-Euler numbers and polynomials by using their generating function and derivative operator. Also, we show between the q-Euler…
We identify a family of numbers for which the Bernoulli convolution is singular. Within this family we find two countable collections of Salem numbers in the interval $(1,2)$, and another Salem number and an algebraic integer that is…
In this paper we consider the weighted q-Bernoulli numbers and polynomials which are differnt type of Carlitz's q-Bernoulli numbers and polynomials. From these numbers and polynomials, we derive some interesting formulaes and identities.
We present a new explicit formula for the $m$-th Bernoulli number $B_m$, which involves two integer parameters $a$ and $n$ with $0\le a\le m\le n$. If we set $a=0$ and $n=m$, then the formula reduces to the celebrated Kronecker formula for…
In the paper, by establishing a new and explicit formula for computing the $n$-th derivative of the reciprocal of the logarithmic function, the author presents new and explicit formulas for calculating Bernoulli numbers of the second kind…