Related papers: A Lucas analogue of Eulerian numbers
Balancing numbers $n$ are originally defined as the solution of the Diophantine equation $1+2+\cdots+(n-1)=(n+1)+\cdots+(n+r)$, where $r$ is called the balancer corresponding to the balancing number $n$. By slightly modifying, $n$ is the…
A fast simple O(\log n) iteration algorithm for individual Lucas numbers is given. This is faster than using Fibonacci based methods because of the structure of Lucas numbers. Using a sqrt 5 conversion factor on Lucus numbers gives a faster…
Two general methods for establishing the logarithmic behavior of recursively defined sequences of real numbers are presented. One is the interlacing method, and the other one is based on calculus. Both methods are used to prove logarithmic…
In this paper, we give a type B analogue of the 1/k-Eulerian polynomials. Properties of this kind of polynomials, including combinatorial interpretations, recurrence relations and gamma-positivity are studied. In particular, we show that…
This paper finds all Lucas numbers which are the sum of two Jacobsthal numbers. It also finds all Jacobsthal numbers which are the sum of two Lucas numbers. In general, we find all non-negative integer solutions $(n, m, k)$ of the two…
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.
Let $A(n,m)$ denote the Eulerian numbers, which count the number of permutations on $[n]$ with exactly $m$ descents. It is well known that $A(n,m)$ also counts the number of permutations on $[n]$ with exactly $m$ excedances. In this report,…
A second order polynomial sequence is of Fibonacci type (Lucas type) if its Binet formula is similar in structure to the Binet formula for the Fibonacci (Lucas) numbers. In this paper we generalize identities from Fibonacci numbers and…
In this paper we first present summation formulas for $k$-order Eulerian polynomials and $1/k$-Eulerian polynomials. We then present combinatorial expansions of $(c(x)D)^n$ in terms of inversion sequences as well as $k$-Young tableaux,…
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.
Both Fibonacci and Lucas numbers can be described combinatorially in terms of 0-1 strings without consecutive ones. In the present article we explore the occupation numbers as well as the correlations between various positions in the…
Polynomial interpretations are a useful technique for proving termination of term rewrite systems. They come in various flavors: polynomial interpretations with real, rational and integer coefficients. As to their relationship with respect…
This paper introduces a colored generalization of the Eulerian polynomials, denoted the $\alpha$-colored Eulerian polynomials. We first compute these polynomials by taking the $h$-vector of the $\alpha$-colored permutohedron, a colored…
Following our earlier work, where doubly indexed and irreducible over Q two-variable Laguerre polynomials were introduced, we prove for such polynomials some recurrence formulas and obtain a generating function. In addition, we show how…
Generalized Euler polynomials ${{\alpha }_{n}}\left( x \right)={{\left( 1-x \right)}^{n+1}}\sum\nolimits_{m=0}^{\infty }{{{p}_{n}}}\left( m \right){{x}^{m}}$, where ${{p}_{n}}\left( x \right)$ is the polynomial of degree $n$, are the…
A recurrent formula is presented, for the enumeration of the compositions of positive integers as sums over multisets of positive integers, that closely resembles Euler's recurrence based on the pentagonal numbers, but where the…
Using generalized binomial coefficients with respect to fundamental Lucas sequences we establish congruences that generalize the classical congruence of Wolstenholme and other related stronger congruences.
In this article we generalize the $q$-difference operator due to Carlitz in order to derive explicit sum formulae for several extensions of Stirling numbers of the second kind, including complete homogeneous symmetric functions,…
We exhibit a family of sequences of noncommutative variables, recursively defined using monic palindromic polynomials in $\mathbb Q[x]$, and show that each possesses the Laurent phenomenon. This generalizes a conjecture by Kontsevich.
We show that q-Catalan numbers, q- central binomial coefficients and q- Narayana polynomials are moments of q-analogues of Fibonacci and Lucas polynomials and related polynomials.