Related papers: Links Between Sums Over Paths in Bernoulli's Trian…
We use the inversion of coefficient arrays to define dual polynomials to the Fibonacci and Catalan-Fibonacci polynomials, and we explore the properties of these new polynomials sequences. Many of the arrays involved are Riordan arrays.…
Powers of Fibonacci polynomials are expressed as single sums, improving on a double sum recently seen in the literature.
A polynomial triangle is an array whose inputs are the coefficients in integral powers of a polynomial. Although polynomial coefficients have appeared in several works, there is no systematic treatise on this topic. In this paper we plan to…
We present numerous interesting, mostly new, results involving the $n$-step Fibonacci numbers and $n$-step Lucas numbers and a generalization. Properties considered include recurrence relations, summation identities, including binomial and…
Starting with some determinants of binomial coefficients which are related to Fibonacci and Lucas polynomials we study similar determinants for some generalizations of these polynomials and their q-analogues.
We present a lovely connection between the Fibonacci numbers and the sums of inverses of $(0,1)-$ triangular matrices, namely, a number $S$ is the sum of the entries of the inverse of an $n \times n$ $(n \geq 3)$ $(0,1)-$ triangular matrix…
We prove certain identities involving Euler and Bernoulli polynomials that can be treated as recurrences. We use these and also other known identities to indicate connection of Euler and Bernoulli numbers with entries of inverses of certain…
In this paper, we establish a fundamental connection between binomial parameters and means of bounded random variables. Such connection finds applications in statistical inference of means of bounded variables.
In this paper, we study the binomial sum $S_{n}(q):=% \overset{n}{\underset{k=0}{\sum }}a_{k}\binom{n}{k}\left( 1-q\right) ^{k}q^{n-k}$ for a given sequence $\left( a_{n}\right) $ of real or complex numbers. We express $S_{n}(q)$ in…
In this paper, we define Tribonacci-Lucas polynomials and present Tribonacci-Lucas numbers and polynomials as a binomial sum. Then, we introduce incomplete Tribonacci-Lucas numbers and polynomials. In addition we derive recurrence…
We realize that geometric polynomials and p-Bernoulli polynomials and numbers are closely related with an integral representation. Therefore, using geometric polynomials, we extend some properties of Bernoulli polynomials and numbers such…
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…
We present a certain generalization of a recent result of M. I. Cirnu on linear recurrence relations with coefficient in progressions [2]. We provide some interesting examples related to some well-known integer sequences, such as Fibonacci…
We afford the problem of counting the blocks of a given length made with symbols drawn from an alphabet and relate this number to Fibonacci-like recurrent relations. The recurrence polynomia allows to calculate the limit ratio of two…
We derive some, seemingly new, curious additive relations in the Pascal triangle. They arise in summing up the numbers in the triangle along some vertical line up to some place.
We give an expression of polynomials for higher sums of powers of integers via the higher order Bernoulli numbers.
In this article, we present a trick around Fibonacci numbers which can be found in several magic books. It consists in computing quickly the sum of the successive terms of a Fibonacci-like sequence. We give explanations and extensions of…
We derive some Fibonacci and Lucas identities which contain inverse binomial coefficients. Extension of the results to the general Horadam sequence is possible, in some cases.
In this article, we derive a congruence property of particular sum rules involving prime numbers. The resulting expression involves Bernoulli numbers and polynomials, for which we obtain, as a consequence, a general congruence relation as…
We give a generalization of the Pascal triangle called the quasi s-Pascal triangle where the sum of the elements crossing the diagonal rays produce the s-bonacci sequence. For this, consider a lattice path in the plane whose step set is {L…