bn:03602418n
Noun Concept
Categories: Recurrence relations, Integer sequences
EN
Lucas sequence  Fibonacci family
EN
In mathematics, the Lucas sequences U n {\displaystyle U_{n}} and V n {\displaystyle V_{n}} are certain constant-recursive integer sequences that satisfy the recurrence relation x n = P ⋅ x n − 1 − Q ⋅ x n − 2 {\displaystyle x_{n}=P\cdot x_{n-1}-Q\cdot x_{n-2}} where P {\displaystyle P} and Q {\displaystyle Q} are fixed integers. Wikipedia
Definitions
Relations
Sources
EN
In mathematics, the Lucas sequences U n {\displaystyle U_{n}} and V n {\displaystyle V_{n}} are certain constant-recursive integer sequences that satisfy the recurrence relation x n = P ⋅ x n − 1 − Q ⋅ x n − 2 {\displaystyle x_{n}=P\cdot x_{n-1}-Q\cdot x_{n-2}} where P {\displaystyle P} and Q {\displaystyle Q} are fixed integers. Wikipedia
Constant-recursive integer sequence that satisfy the recurrence relation Wikidata
HAS KIND
HAS INSTANCE
DIFFERENT FROM
NAMED AFTER
Wikipedia
Wikidata
Wikipedia Redirections