Related papers: Combinatorial interpretations of binomial coeffici…
The Lucas sequence is a sequence of polynomials in s, and t defined recursively by {0}=0, {1}=1, and {n}=s{n-1}+t{n-2} for n >= 2. On specialization of s and t one can recover the Fibonacci numbers, the nonnegative integers, and the…
Given two variables $s$ and $t$, the associated sequence of Lucas polynomials is defined inductively by $\{0\}=0$, $\{1\}=1$, and $\{n\}=s\{n-1\}+t\{n-2\}$ for $n\ge2$. An integer (e.g., a Catalan number) defined by an expression of the…
Lucas polynomials are polynomials in $s_1$ and $s_2$ defined recursively by $\{0\}=0$, $\{1\}=1$, and $\{m\}=s_1\{m-1\}+s_2\{m-2\}$ for $m \geq 2$. We generalize Lucas polynomials from 2-variable polynomials to multivariable polynomials.…
The Lucas polynomials, $\{n\}$, are polynomials in $s$ and $t$ given by $\{ n \} = s \{ n-1 \} + t \{ n-2 \}$ for $n \geq 2$ with $ \{ 0 \} = 0$ and $\{ 1 \} = 1$. The lucanomial coefficients, an analogue of the binomial coefficients, are…
The focus of this paper is the study of generalized Fibonacci polynomials and Fibonomial coefficients. The former are polynomials {n} in variables s and t given by {0} = 0, {1} = 1, and {n} = s{n-1}+t{n-2} for n ge 2. The latter are defined…
We start with a (q,t)-generalization of a binomial coefficient. It can be viewed as a polynomial in t that depends upon an integer q, with combinatorial interpretations when q is a positive integer, and algebraic interpretations when q is…
The generalized Lucas numbers are polynomials in two variables with nonnegative integer coefficients. Lucas versions of some combinatorial numbers with known formulas in terms of quotient and products of nonnegative integers have been…
We explore new types of binomial sums with Fibonacci and Lucas numbers. The binomial coefficients under consideration are $\frac{n}{n+k}\binom{n+k}{n-k}$ and $\frac{k}{n+k}\binom{n+k}{n-k}$. The identities are derived by relating the…
We study sums of powers of Fibonacci and Lucas polynomials of the form $% \sum_{n=0}^{q}F_{tsn}^{k}(x) $ and $\sum_{n=0}^{q}L_{tsn}^{k}% (x) $, where $s,t,k$ are given natural numbers, together with the corresponding alternating sums…
This paper presents new identities expressing the terms of Fibonacci, Lucas, and generalized Fibonacci sequences with multiple indices through powers of Lucas numbers and binomial coefficients. The obtained formulas rely on the application…
Up to our knowledge -since about 126 years we were lacking of classical type combinatorial interpretation of Fibonomial coefficients as it was Lukas \cite{1} - to our knowledge -who was the first who had defined Finonomial coefficients and…
In this note, we study the divisibility relation $U_m\mid U_{n+k}^s-U_n^s$, where ${\bf U}:=\{U_n\}_{n\ge 0}$ is the Lucas sequence of characteristic polynomial $x^2-ax\pm 1$ and $k,m,n,s$ are positive integers.
In this paper, we introduce relations between binomial sums involving (generalized) Fibonacci and Lucas numbers, and different kinds of binomial coefficients. We also present some relations between sums with two and three binomial…
Let $\{U_n\}_{n\geq 0}$ be a Lucas sequence. Then the equation $$|U_n|=m_1!m_2!\cdots m_k!$$ with $1<m_1\leq m_2\leq \cdots\leq m_k$ implies $n\in \{1,2, 3, 4, 6, 8, 12\}$. Further the equation $$|U_n|=D_{m_1}D_{m_2}\cdots D_{m_k}, \qquad…
For Lucas sequences of the first kind (u_n) and second kind (v_n) defined as usual for positive n by u_n=(a^n-b^n)/(a-b), v_n=a^n+b^n, where a and b are either integers or conjugate quadratic integers, we describe the set of indices n for…
A positive integer $n$ is called a balancing number if there exists a positive integer $r$ such that $1 + 2 + \cdots + (n-1) = (n+1) + (n+2) + \cdots + (n+r)$. The corresponding value $r$ is known as the balancer of $n$. If $n$ is a…
We define a new generalization of Catalan numbers to multinomial coefficients. With arithmetic methods, we study their integrality and the integrality of their Lucasnomial generalization. We give a complete characterization of regular Lucas…
In this article, we give a formula for the generalization of the binomial coefficient to the complex numbers as a linear combination of $\sinc$ functions. We then give a general formula to compute the integral on the real line of the…
Let $(L_n)_{n \geq 1}$ be the sequence of Lucas numbers, defined recursively by $L_1 := 1$, $L_2 := 3$, and $L_{n + 2} := L_{n + 1} + L_n$, for every integer $n \geq 1$. We determine the asymptotic behavior of $\log \operatorname{lcm} (L_1…
We derive a collection of identities for bivariate Fibonacci and Lucas polynomials using essentially a matrix approach as well as properties of such polynomials when the variables $x$ and $y$ are replaced by polynomials. A wealth of…