# Lucas sequence

olemus
arvujada L[n], mis rahuldab alljärgnevat rekurrentset seost:
(i) L[0] = 2
(ii) L[1] = 1
(iii) L[n] = L[n-1] + L[n-2] kui n >1.
=
a sequence based on a recurrence relation to generate the next terms, each term being the sum of two immediately previous terms

ülevaateid
https://en.wikipedia.org/wiki/Lucas_sequence

https://mathworld.wolfram.com/LucasSequence.html

https://www.mscs.dal.ca/~pronk/1600/Fibonacci

rakendusi
- LUC

# Lucas sequence

olemus
arvujada L[n], mis rahuldab alljärgnevat rekurrentset seost:
(i) L[0] = 2
(ii) L[1] = 1
(iii) L[n] = L[n-1] + L[n-2] kui n >1.
=
a sequence based on a recurrence relation to generate the next terms, each term being the sum of two immediately previous terms

ülevaateid
https://en.wikipedia.org/wiki/Lucas_sequence

https://mathworld.wolfram.com/LucasSequence.html

https://www.mscs.dal.ca/~pronk/1600/Fibonacci

rakendusi
- LUC

Palun oodake...

# Lucas sequence

olemus
arvujada L[n], mis rahuldab alljärgnevat rekurrentset seost:
(i) L[0] = 2
(ii) L[1] = 1
(iii) L[n] = L[n-1] + L[n-2] kui n >1.
=
a sequence based on a recurrence relation to generate the next terms, each term being the sum of two immediately previous terms

ülevaateid
https://en.wikipedia.org/wiki/Lucas_sequence

https://mathworld.wolfram.com/LucasSequence.html