English
English
Arabic
Chinese
Dutch
French
German
Greek
Hebrew
Hindi
Italian
Japanese
Korean
Polish
Portuguese
Russian
Spanish
more...
Translate into...
English
Arabic
Chinese
Dutch
French
German
Greek
Hebrew
Hindi
Italian
Japanese
Korean
Polish
Portuguese
Russian
Spanish
more...
bn:03602418n
Noun Concept
Categories: Integer sequences, Recurrence relations
EN
Lucas sequence  Fibonacci family
See more
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
Quit
Change View
Definitions
Relations
Sources
English
More languages...
English
Arabic
Chinese
Dutch
French
German
Greek
Hebrew
Hindi
Italian
Japanese
Korean
Polish
Portuguese
Russian
Spanish
more...
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
Wikipedia
Wikidata
Wikipedia Redirections