Related papers: Binomial transforms of the modified k-Fibonacci-li…
Discrete analogs of the Lebedev transforms with the product of the modified Bessel functions are introduced and investigated. Several expansions of suitable functions and sequences in terms of the series and integrals, involving the…
We define the convolved h(x)-Fibonacci polynomials as an extension of the classical convolved Fibonacci numbers. Then we give some combinatorial formulas involving the h(x)-Fibonacci and h(x)-Lucas polynomials. Moreover we obtain the…
The classical Fibonacci sequence is known to exhibit many fascinating properties. In this paper, we explore the Fibonacci sequence and integer sequences generated by second order linear recurrence relations with positive integer…
We prove that the difference between the $n$-th hyperfibonacci number of $r$-th generation and its two consecutive predecessors is the $n$-th regular $(r-1)$-topic number. Using this fact we provide an equivalent recursive definition of…
The summation formula within pascalian triangle resulting in the fibonacci sequence is extended to the $q$-binomial coefficients $q$-gaussian triangles.
Discrete analogs of the index transforms, involving Bessel and the modified Bessel functions are introduced and investigated. The corresponding inversion theorems for suitable classes of functions and sequences are established.
Any permutation has a disjoint cycle decomposition and concept generates an equivalence class on the symmetry group called the cycle-type. The main focus of this work is on permutations of restricted cycle-types, with particular emphasis on…
Multiple binomial sums form a large class of multi-indexed sequences, closed under partial summation, which contains most of the sequences obtained by multiple summation of products of binomial coefficients and also all the sequences with…
An algebraic deformation theory of module-algebras over a bialgebra is constructed. The cases of module-coalgebras, comodule-algebras, and comodule-coalgebras are also considered.
We consider finite iterated generalized harmonic sums weighted by the binomial $\binom{2k}{k}$ in numerators and denominators. A large class of these functions emerges in the calculation of massive Feynman diagrams with local operator…
In this note we investigate the solutions of certain meta-Fibonacci recurrences of the form $f(n)=f(n-f(n-1))+f(n-2)$ for various sets of initial conditions. In the case when $f(n)=1$ for $n\leq 1$, we prove that the resulting integer…
In this paper Fourier transform of multivariate orthogonal polynomials on the simplex is presented. A new family of multivariate orthogonal functions is obtained by using the Parseval's identity and several recurrence relations are derived.
We show that various aspects of k-automatic sequences -- such as having an unbordered factor of length n -- are both decidable and effectively enumerable. As a consequence it follows that many related sequences are either k-automatic or…
In this paper, we continue our investigation of double sums where the inner sum is binomial but incomplete. We prove many new results for these types of double sums associated with binomial transform pairs. As applications we deduce new…
We discuss the construction of oscillator-like systems associated with orthogonal polynomials on the example of the Fibonacci oscillator. In addition, we consider the dimension of the corresponding lie algebras.
We study higher-dimensional interlacing Fibonacci sequences, generated via both Chebyshev type functions and $m$-dimensional recurrence relations. For each integer $m$, there exist both rational and integer versions of these sequences,…
We study compositions whose parts are colored by subsequences of the Fibonacci numbers. We give explicit bijections between Fibonacci colored compositions and several combinatorial objects, including certain restricted ternary and…
In this work, we introduce a symmetric algorithm obtained by the recurrence relation a_{n}^{k}=a_{n-1}^{k}+a_{n}^{k-1}. We point out that this algorithm can be apply to hyperharmonic-, ordinary and incomplete Fibonacci- and Lucas numbers.…
In this note we prove an explicit binomial formula for Jack polynomials and discuss some applications of it.
The sequence $F_{dn+h}$ and its convolutions have (for $h=0$) been studied in a recent paper at the arxiv [arXiv:2603.08636]. The instance with general $h$ is more involved and uses Chebyshev polynomials.