Results 91 to 100 of about 26,336 (246)
On the pulsating (m,c)-Fibonacci sequence. [PDF]
Laipaporn K +2 more
europepmc +1 more source
On Period of the Sequence of Fibonacci Polynomials Modulo
It is shown that the sequence obtained by reducing modulo coefficient and exponent of each Fibonacci polynomials term is periodic. Also if is prime, then sequences of Fibonacci polynomial are compared with Wall numbers of Fibonacci sequences according ...
İnci Gültekin, Yasemin Taşyurdu
doaj +1 more source
New Fibonacci-type pulsated sequences. Part 2 [PDF]
A new Fibonacci sequence from a pulsated type is introduced. The explicit form of its members is given.
Lilija Atanassova, Velin Andonov
doaj +1 more source
Elementary sequences, sub-Fibonacci sequences
A nondecreasing integer sequence \(x_ 1,x_ 2,\dots,x_ k\) with \(x_ 1=x_ 2=1\) and \(n \geq 2\) is said to be elementary if for all \(k \leq n\) \((x_ k>1 \Rightarrow x_ k=x_ i+x_ j\) for some \(i \neq j)\) and sub- Fibonacci if for all \(k \in \{3,\dots,n\}\) \((x_ k \leq x_{k-1}+x_{k- 2})\).
Fishburn, Peter C., Roberts, Fred S.
openaire +1 more source
A trick around Fibonacci, Lucas and Chebyshev
In this article, we present a trick around Fibonacci numbers which can be found in several magic books. It consists in computing quickly the sum of the successive terms of a Fibonacci-like sequence.
Lachal, Aimé
core +1 more source
On the connections between Fibonacci and Mulatu Numbers
In this work, we present a detailed study of the Fibonacci--Mulatu sequence, {FMn}, defined recursively by FMn+2=FMn+1+FMn with initial terms FM0 = 4 and FM1 = 1.
Eudes Antonio Costa +2 more
doaj +1 more source
Recurrence algorithms of waiting time for the success run of length $k$ in relation to generalized Fibonacci sequences [PDF]
Jung‐Taek Oh +2 more
openalex +1 more source
The structure of palindromes in the Fibonacci sequence and some applications [PDF]
Yuke Huang, Zhi‐Ying Wen
openalex +1 more source
Tantalizing properties of subsequences of the Fibonacci sequence modulo 10 [PDF]
Dan Guyer, Aba Mbirika, Miko Scott
openalex +1 more source
(±1)-Invariant sequences and truncated Fibonacci sequences
Let \(P\) and \(D\) denote the Pascal matrix \(\bigl[\binom{i}{j}\bigr]\), (\(i,j=0,1,2,\dots\)) and the diagonal matrix \(\text{diag}((-1)^0,(-1)^1,(-1)^2,\dots)\), respectively. An infinite-dimensional real vector \(\mathbf x\) is called a \(\lambda\)-invariant sequence if \(PD\mathbf x=\lambda\mathbf x\).
Choi, Gyoung-Sik +3 more
openaire +1 more source

