Related papers: Summing a family of generalized Pell numbers
The aim of this paper is to give some combinatorial relations linked polynomials generalizing those of Appell type to the partial r-Bell polynomials. We give an inverse relation, recurrence relations involving some family of polynomials and…
The aim of this article is to define some new families of the special numbers. These numbers provide some further motivation for computation of combinatorial sums involving binomial coefficients and the Euler kind numbers of negative order.…
In this note, we propose simple summations for primes, which involve two finite nested sums and Bernoulli numbers. The summations can also be expressed in terms of Bernoulli polynomials.
A new general and unified method of summation, which is both regular and consistent, is invented. It is based on the idea concerning a way of integers reordering. The resulting theory includes a number of explicit and closed form summation…
We give a combinatorial proof of a formula giving the partial sums of the $k$-bonacci sequence as alternating sums of powers of two multiplied by binomial coefficients. As a corollary we obtain a formula for the $k$-bonacci numbers.
The problem of finding the sum of a polynomial's values is considered. In particular, for any $n\geq 3$, the explicit formula for the sum of the $n$th powers of natural numbers $S_n=\sum_{x=1}^{m}x^{n}$ is proved:…
In this note we augment the poly-Bernoulli family with two new combinatorial objects. We derive formulas for the relatives of the poly-Bernoulli numbers using the appropriate variations of combinatorial interpretations. Our goal is to show…
In this paper, we construct Pell matrices, analogous to Fibonacci matrices, to study algebraic properties of Pell numbers via linear algebra. This framework yields identities involving the trace, inverse, and determinant, as well as matrix…
In this paper, we use Abel's summation formula to evaluate several quadratic and cubic sums of the form: \[{F_N}\left( {A,B;x} \right) := \sum\limits_{n = 1}^N {\left( {A - {A_n}} \right)\left( {B - {B_n}} \right){x^n}} ,\;x \in [ - 1,1]\]…
In this work, we made a generalization that includes all bicomplex Fibonacci-like numbers such as; Fibonacci, Lucas, Pell, etc.. We named this generalization as bicomplex Horadam numbers. For bicomplex Fibonacci and Lucas numbers we gave…
This paper is concerned with developing some new identities of generalized Fibonacci numbers and generalized Pell numbers. A new class of generalized numbers is introduced for this purpose. The two well-known identities of Sury and Marques…
The coefficients occurring in summation formulae of the Lubbock type are shown to be generalised Bernoulli polynomials which turn up in subdivision questions such as quantum field theory around a conical singularity and on spherical lunes.…
In this paper, closed forms of the summation formulas for generalized Tribonacci numbers are presented. Then, some previous results are recovered as particular cases of the present results. As special cases, we give summation formulas of…
A new family of sequences is proposed. An example of sequence of this family is more accurately studied. This sequence is composed by the integers $n$ for which the sum of binary digits is equal to the sum of binary digits of $n^2$. Some…
The series expansion of a power of the modified Bessel function of the first kind is studied. This expansion involves a family of polynomials introduced by C. Bender et al. New results on these polynomials established here include…
We prove a duality formula for certain sums of values of poly-Bernoulli polynomials which generalizes dualities for poly-Bernoulli numbers. We first compute two types of generating functions for these sums, from which the duality formula is…
In 2015, Phulara established a generalization of the famous central set theorem by an original idea. Roughly speaking, this idea extends a combinatorial result from one large subset of the given semigroup to countably many. In this paper,…
This is a collection of definitions, notations and proofs for the Bernoulli numbers $B_n$ appearing in formulas for the sum of integer powers, some of which can be found scattered in the large related historical literature in French,…
We present a method of computing the generating function $f_P(\x)$ of $P$-partitions of a poset $P$. The idea is to introduce two kinds of transformations on posets and compute $f_P(\x)$ by recursively applying these transformations. As an…
A novel method of summation for power series is developed. The method is based on the self-similar approximation theory. The trick employed is in transforming, first, a series expansion into a product expansion and in applying the…