Results 161 to 170 of about 903 (200)
Cognitive representation in transitive inference: a comparison of four corvid species. [PDF]
Bond AB, Wei CA, Kamil AC.
europepmc +1 more source
CONGRUENCES INVOLVING COMBINATIONS OF THE BERNOULLI AND FIBONACCI NUMBERS. [PDF]
Kelisky RP.
europepmc +1 more source
A Note on the Bi-Periodic Fibonacci and Lucas Matrix Sequences [PDF]
Abstract In this paper, we introduce the bi-periodic Lucas matrix sequence and present some fundamental properties of this generalized matrix sequence. Moreover, we investigate the important relationships between the bi-periodic Fibonacci and Lucas matrix sequences. We express that some behaviors of bi-periodic Lucas numbers also can be obtained by
Arzu Coşkun
exaly +4 more sources
Diophantine Equations Involving the Bi-Periodic Fibonacci and Lucas Sequences [PDF]
In this paper, we present new identities involving the biperiodic Fibonacci and Lucas sequences. Then we solve completely some quadratic Diophantine equations involving the bi-periodic Fibonacci and Lucas ...
Lyes Ait-Amrane
exaly +2 more sources
The Degree Sequence of Fibonacci and Lucas Cubes
The Fibonacci cube $\Gamma_n$ is the subgraph of the $n$-cube induced by the binary strings that contain no two consecutive 1's. The Lucas cube $\Lambda_n$ is obtained from $\Gamma_n$ by removing vertices that start and end with 1. It is proved that the number of vertices of degree $k$ in $\Gamma_n$ and $\Lambda_n$ is $\sum_{i = 0}^k \binom{n-2i}{k-i} \
Sandi Klavžar +2 more
exaly +5 more sources
On the Sequences Related to Fibonacci and Lucas Numbers [PDF]
The sequences \(\{U_n\}_{n\geq 0}\) and \(\{V_n\}_{n\geq 0}\) are introduced by recurrence relations: \[ \begin{aligned} U_n &= (q- 2)(U_{n-2}- U_{n-4},\;n\geq 4,\\ V_n &= (q-2) V_{n-2}- V_{n-4},\;n\geq 4\end{aligned} \] with initial conditions \(U_0= 0\), \(U_1= 1\), \(U_2= 1\), \(U_4= q- 1\), \(V_0= 2\), \(V_1= 1\), \(V_2= q-1\), where \(q\geq 5\) is
Nihal Yilmaz Özgür
exaly +5 more sources

