Difference between revisions of "Lucas Numbers"

(Stub)
 
Line 2: Line 2:
  
  
[hide]The Lucas numbers <math>L_n</math> are given by the recursion <math>L_0 = 2, L_1 = 1</math>, and <math>L_n = L_{n-1} + L_{n-2}</math>.[/hide]
+
The Lucas numbers <math>L_n</math> are given by the recursion <math>L_0 = 2, L_1 = 1</math>, and <math>L_n = L_{n-1} + L_{n-2}</math>.
 +
 
 +
 
 +
{{stub}}

Latest revision as of 12:44, 30 July 2025

Lucas Numbers are a recursive sequence defined as \[L_0=2\\L_1=1\\L_n=L_{n-1}+L_{n-2}\].


The Lucas numbers $L_n$ are given by the recursion $L_0 = 2, L_1 = 1$, and $L_n = L_{n-1} + L_{n-2}$.


This article is a stub. Help us out by expanding it.