Lucas sequence ^English (Q1759646)

Item Discussion

constant-recursive integer sequence that satisfy the recurrence relation ^English

Language	Label	Description	Also known as
British English	No label defined	No description defined

Statements

/m/036t82

1 reference

Q15241312 (Deleted Item)

publication date

28 October 2013

Q274377 (Deleted Item)

0 references

Q23835453 (Deleted Item)

0 references

integer sequence ^English

0 references

MathWorld identifier

LucasSequence

1 reference

imported from Wikimedia project

English Wikipedia

defining formula

U_{0}(P,Q)=0,\quad U_{1}(P,Q)=1,\quad U_{n+2}(P,Q)=P\cdot U_{n+1}(P,Q)-Q\cdot U_{n}(P,Q),\,n\geq 0;V_{0}(P,Q)=2,\quad V_{1}(P,Q)=P,\quad V_{n+2}(P,Q)=P\cdot V_{n+1}(P,Q)-Q\cdot V_{n}(P,Q)

0 references

03602418n

1 reference

Encyclopædia Britannica Online ID

topic/Lucas-sequence

0 references

Microsoft Academic ID

154977054

0 references

0 references

C154977054

1 reference

Q107507571 (Deleted Item)

26 January 2022

https://docs.openalex.org/download-snapshot/snapshot-data-format

Retrieved from ‘https://stockhub.co/index.php?title=Item:Q1759646&oldid=1015644’