Results 301 to 310 of about 248,402 (331)
kMermaid: Ultrafast metagenomic read assignment to protein clusters by hashing of amino acid k-mer frequencies. [PDF]
PLoS Comput BiolLucas A +3 more
europepmc +1 more source
The sequences of Fibonacci and Lucas for quadratic fields
P. Lam-Estrada +5 more
openalex +1 more source
Tumor-infiltrating lymphocytes-derived CD8<sup>+</sup> clonotypes infiltrate the tumor tissue and mediate tumor regression in glioblastoma. [PDF]
OncoimmunologyArruda LCM +8 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
The Fibonacci Quarterly, 2015
Consider the Lucas sequence u(a, b) = (un(a, b)) and the companion Lucas sequence v(a, b) = (vn(a, b)) which both satisfy the second order recursion relation wn+2 = awn+1 − bwn with initial terms u0 = 0, u1 = 1, and v0 = 2, v1 = a, respectively. We give both necessary and sufficient tests and also necessary tests for the primality of |un| and |vn|. For
Křížek, M. (Michal), Somer, L.
openaire +2 more sources
Consider the Lucas sequence u(a, b) = (un(a, b)) and the companion Lucas sequence v(a, b) = (vn(a, b)) which both satisfy the second order recursion relation wn+2 = awn+1 − bwn with initial terms u0 = 0, u1 = 1, and v0 = 2, v1 = a, respectively. We give both necessary and sufficient tests and also necessary tests for the primality of |un| and |vn|. For
Křížek, M. (Michal), Somer, L.
openaire +2 more sources
Palindromes in Lucas Sequences
Monatshefte f�r Mathematik, 2003Say that \(\{w_n\}\) is a Lucas sequence if \(w_{n+2}= rw_{n+1}+sw_n\) where \(s\neq 0\) and \(r^2+4s\neq 0\). An integer is called a palindrome to base \(b\) if the base \(b\) representation of the integer is left unchanged when the digits are reversed. Let \(P(x)\) denote the number of integers \(n\leq x\) such that \(w_n\) is a base \(b\) palindrome.
openaire +3 more sources
On the Completeness of the Lucas Sequence
The Fibonacci Quarterly, 1969A sequence of positive integers is said to be complete if every positive integer is the sum of a finite number of distinct terms of the sequence. It is well-known that the Lucas sequence \(\{L_j\}\) where \(L_{n+1}=L_n+L_{n-1}\) for \(n>1\) and \(L_0=2\), \(L_1=1\) is complete. In this paper the author proves that if any term \(L_n\), where \(n>1\), is
openaire +2 more sources
AIP Conference Proceedings, 2014
For positive integers n and k, the k-Lucas sequence is defined by the recurrence relation Ln+1 = kLn+Ln−1 with the initial values L0 = 2, L1 = k. The Lucas sequence and Pell-Lucas sequence are two special cases of the k-Lucas sequence. Using a matrix approach, we uncover some new facts concerning the k-Lucas sequence.
Jye-Ying Sia, C. K. Ho, Chin-Yoon Chong
openaire +2 more sources
For positive integers n and k, the k-Lucas sequence is defined by the recurrence relation Ln+1 = kLn+Ln−1 with the initial values L0 = 2, L1 = k. The Lucas sequence and Pell-Lucas sequence are two special cases of the k-Lucas sequence. Using a matrix approach, we uncover some new facts concerning the k-Lucas sequence.
Jye-Ying Sia, C. K. Ho, Chin-Yoon Chong
openaire +2 more sources
Lucas Sequences in Primality Testing
2014Prime or composite? This classification determines whether or not integers can be used in digital security. One such way to begin testing an integers primality is with the Fermat test, which says that if n is a prime number and a is an integer then an-1 1 mod n.
openaire +1 more source