Related papers: A shortened recurrence relation for the Bernoulli …

The simplest non-trivial solutions of WDVV equations are A_n and B_n-potentials, which describe metrics of K.Saito on spaces of versal deformation of A_n and B_n-singularities. These are some polynomials, which were known for $n\leqslant$…

We define a triangular array closely related to Stern's diatomic array and show that for a fixed integer $r\geq 1$, the sum $u_r(n)$ of the $r$th powers of the entries in row $n$ satisfy a linear recurrence with constant coefficients. The…

We recast homogeneous linear recurrence sequences with fixed coefficients in terms of partial Bell polynomials, and use their properties to obtain various combinatorial identities and multifold convolution formulas. Our approach relies on a…

In this research, as the new results of our previously proposed definition for the new class of $2D$ $q$-Appell polynomials, we derive some interesting relations including the recurrence relation and partial $q$-difference equation of the…

In this paper we present a new proof of the following 2010 result of Dubickas, Novikas, and Siurys: Let $(a,b)\in \mathbb{Z}^2$ and let $(x_n)_{n\ge 0}$ be the sequence defined by some initial values $x_0$ and $x_1$ and the second order…

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…

We present new proofs for some summation identities involving Stirling numbers of both first and second kind. The two main identities show a connection between Stirling numbers and Bessel numbers. Our method is based on solving a particular…

We derive weighted summation identities involving the second order recurrence sequence $\{w_n\} =\{ w_n(a,b; p, q)\}$ defined by $w_0 = a,\,w_1 = b;\,w_n = pw_{n - 1} - qw_{n - 2}\, (n \ge 2)$, where $a$, $b$, $p$ and $q$ are arbitrary…

In this article we obtain an explicit formula in terms of the partitions of the positive integer $n$ to express the $n$-th term of a wide class of sequences of numbers defined by recursion. Our proof is based only on arithmetics. We compare…

In this paper, we consider the poly-Bernoulli numbers and polynomials of the second kind and presents new and explicit formulae for calculating the poly-Bernoulli numbers of the second kind and the Stirling numbers of the second kind.

Using combinatorial techniques, we derive a recurrence identity that expresses an exponential power sum with negative powers in terms of another exponential power sum with positive powers. Consequently, we derive a formula for the power sum…

Let $(U_n)_{n\geq 0}$ be a fixed linear recurrence sequence of integers with order at least two, and for any positive integer $\ell$, let $\ell \cdot 2^{\ell} + 1$ be a Cullen number. Recently in \cite{bmt}, generalized Cullen numbers in…

The Riemann zeta identity at even integers of Lettington, along with his other Bernoulli and zeta relations, are generalized. Other corresponding recurrences and determinant relations are illustrated. Another consequence is the application…

We present an algorithm which, given a linear recurrence operator $L$ with polynomial coefficients, $m \in \mathbb{N}\setminus\{0\}$, $a_1,a_2,\ldots,a_m \in \mathbb{N}\setminus\{0\}$ and $b_1,b_2,\ldots,b_m \in \mathbb{K}$, returns a…

In this paper we improve drastically the estimate for the multiplicity of a binary recurrence. The main contribution comes from an effective version of the Faltings' Product Theorem.

It is well known that the derangement numbers $d_n$, which count permutations of length $n$ with no fixed points, satisfy the recurrence $d_n=nd_{n-1}+(-1)^n$ for $n\ge1$. Combinatorial proofs of this formula have been given by Remmel,…

Stanley, building on work of Stern, defined an array of numbers by the recurrence $s(n, 2k) = s(n-1, k)$, $s(n, 2k+1) = s(n-1, k) + s(n-1, k+1)$. Stanley showed that, for each positive integer $r$, the sequence $s_n^r:= \sum_k s(n,k)^r$…

We give bijective results between several variants of lattice paths of length $2n$ (or $2n-2$) and integer compositions of n, all enumerated by the seemingly innocuous formula $4^{n-1}$. These associations lead us to make new connections…

In this article we present a new recurrence formula for a finite sum involving the Fibonacci sequence. Furthermore, we state an algorithm to compute the sum of a power series related to Fibonacci series, without the use of term-by-term…

For every positive integer $n$ and every $\delta \in [0,1]$, let $B(n, \delta)$ denote the probabilistic model in which a random set $A \subseteq \{1, \dots, n\}$ is constructed by choosing independently every element of $\{1, \dots, n\}$…