Related papers: Some remarks on generalized Fibonacci and Lucas po…
Spivey presented a new approach to evaluate combinatorial sums by using finite differences. We present some closed forms for sums involving the binomial coefficients, Fibonacci and Lucas numbers in terms of the falling factorial.
In this paper we consider particular generalized compositions of a natural number with a given number of parts. Its number is a weighted polynomial coefficient. The number of all generalized compositions of a natural number is a weighted…
We evaluate some types of infinite series with balancing and Lucas-balancing polynomials in closed form. These evaluations will lead to some new curious series for $\pi$ involving Fibonacci and Lucas numbers. Our findings complement those…
This note collects some results and conjectures for the generating functions of the Hankel determinants of certain polynomials which are related to Motzkin paths.
A generalization of Hurwitz stable polynomials to real rational functions is considered. We establishe an analogue of the Hurwitz stability criterion for rational functions and introduce a new type of determinants that can be treated as a…
In this paper, we introduce three new classes of binomial sums involving Fibonacci (Lucas) numbers and weighted binomial coefficients.
Using an explicit computable expression of ordinary multinomials, we establish three remarkable connections, with the q-generalized Fibonacci sequence, the exponential partial Bell partition polynomials and the density of convolution powers…
A class of determinants is introduced. Different kind of mathematical objects, such as Fibonacci, Lucas, Tchebychev, Hermite, Laguerre, Legendre polynomials, sums and covergents are represented as determinants from this class. A closed…
We considered the properties of generalized Fibonacci and Lucas numbers class. The analogues of well-known Fibonacci identities for generalized numbers are obtained. We gained a new identity of product convolution of generalized Fibonacci…
The Concepts of poly-Bernoulli numbers $B_n^{(k)}$, poly-Bernoulli polynomials $B_n^{k}{(t)}$ and the generalized poly-bernoulli numbers $B_{n}^{(k)}(a,b)$ are generalized to $B_{n}^{(k)}(t,a,b,c)$ which is called the generalized…
We investigate paths in Bernoulli's triangles, and derive several relations linking the partial sums of binomial coefficients to the Fibonacci numbers.
We look at the asymptotic behavior of the coefficients of the $q$-binomial coefficients (or Gaussian polynomials) $\binom{a+k}{k}_q$, when $k$ is fixed. We give a number of results in this direction, some of which involve Eulerian…
For an arbitrary homogeneous linear recurrence sequence of order d with constant coefficients, we derive recurrence relations for all subsequences with indices in arithmetic progression. The coefficients of these recurrences are given…
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 introduce a series of numbers which serve as a generalization of Bernoulli, Euler numbers and binomial coefficients. Their properties are applied to solve a probability problem and suggest a statistical test for independence and…
In this overview paper a direct approach to q-Chebyshev polynomials and their elementary properties is given. Special emphasis is placed on analogies with the classical case. There are also some connections with q-tangent and q-Genocchi…
The object of this paper is to generalize a theorem on the binomial coefficient [4] to the case in an arithmetic progression. We will also give a slightly stronger result than Langevin's [2].
We formulate several polynomial identities. One side of these identities has a nice simple form. Whereas the other has a form of a polynomial whose coefficients contain binomial coefficients double factorials or (and) rising factorials. The…
Let s and t be variables. Define polynomials {n} in s, t by {0}=0, {1}=1, and {n}=s{n-1}+t{n-2} for n >= 2. If s, t are integers then the corresponding sequence of integers is called a Lucas sequence. Define an analogue of the binomial…
In this (partly expository) paper we give a short overview about the close relationship between the sequence of Catalan numbers and Hankel determinants from the point of view of orthogonal polynomials and show that an analogous situation…