Related papers: A note on V-binomials recurrence for Lucas compani…
We give the trace representation of a family of binary sequences derived from Euler quotients by determining the corresponding defining polynomials. Trace representation can help us producing the sequences efficiently and analyzing their…
In this paper, we give quadratic approximation of generalized Tribonacci sequence $\{V_{n}\}_{n\geq0}$ defined by Eq. (\ref{eq:7}) and use this result to give the matrix form of the $n$-th power of a companion matrix of…
Combinatorial interpretation of the fibonomial coefficients recently proposed by the present author results here in combinatorial interpretation of the recurrence relation for fibonomial coefficients . The presentation is provided with…
Complete census of wide visual companions to nearby G-dwarf stars can be achieved by selecting candidates from the 2MASS Point-Source Catalog and checking their status by second-epoch imaging. Such data are obtained for 124 candidates with…
Let $(U_n)_{n=0}^\infty$ and $(V_m)_{m=0}^\infty$ be two linear recurrence sequences. For fixed positive integers $k$ and $\ell$, fixed $k$-tuple $(a_1,\dots,a_k)\in \mathbb{Z}^k$ and fixed $\ell$-tuple $(b_1,\dots,b_\ell)\in…
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…
In \cite{luo2006,luosri2005}, Luo and Srivastava introduced some generalizations of the Apostol -Bernoulli polynomials and the Apostol-Euler polynomials. The main object of this paper is to extend the result of \cite{prevost2010} to these…
In this paper, we give some recurrence formula and new and interesting identities for the poly-Bernoulli numbers and polynomials which are derived from umbral calculus.
In this study, we define a new type of Fibonacci and Lucas num- bers which are called bicomplex Fibonacci and bicomplex Lucas numbers. We obtain the well-known properties e.g. Docagnes, Cassini, Catalan for these new types. We also give the…
We establish a recursive relation for the bipartition number $p_2(n)$ which might be regarded as an analogue of Euler's recursive relation for the partition number $p(n)$. Two proofs of the main result are proved in this article. The first…
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…
We give a generalization of Wolstenholme's harmonic series congruence for the Lucas sequences.
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 we obtained several properties that the characteristic polynomials of the unit-primitive matrix satisfy. In addition, using these properties we have shown that the recurrence relation given as in the formula (1) is true. In…
Using a simple transformation, we obtain much simpler forms for some series involving binomial coefficients $\binom{3n}n$ derived by Necdet Batir. New evaluations are given; and connections with Fibonacci numbers and the golden ratio are…
Let $ \prod_{i=1}^d (X-\alpha_i Y) \in{\mathbb C}[X,Y]$ be a binary form and let $\epsilon_1,\dots,\epsilon_d$ be nonzero complex numbers. We consider the family of binary forms $ \prod_{i=1}^d (X-\alpha_i \epsilon_i^aY)$, $a\in {\mathbb…
We generalize the solution of linear recurrence relations from fields to central division algebras, adapting the standard tools of companion matrices and characteristic polynomials to the non-commutative setting. We then solve linear…
The purpose of this note is to extend to Brownian loops some homology and holonomy results obtained in the case of discrete loops on a graph
In 2016, Edgar and, independently of him, Bhatnagar sta\-ted a nice polynomial identity that connects Fibonacci and Lucas numbers. Shortly after their publications, this identity has been generalized in two different ways: Dafnis, Phillipou…
Rejoinder to "The Future of Indirect Evidence" [arXiv:1012.1161]