<?xml version="1.0" encoding="UTF-8"?>

<record version="5" id="1963">
 <title>Lucas numbers</title>
 <name>LucasNumbers</name>
 <created>2002-02-15 01:29:01</created>
 <modified>2006-09-01 09:13:12</modified>
 <type>Definition</type>
 <creator id="13753" name="Mathprof"/>
 <author id="13753" name="Mathprof"/>
 <author id="3" name="drini"/>
 <classification>
	<category scheme="msc" code="11B39"/>
 </classification>
 <synonyms>
	<synonym concept="Lucas numbers" alias="Lucas sequence"/>
 </synonyms>
 <related>
	<object name="FibonacciSequence"/>
 </related>
 <preamble></preamble>
 <content>The \emph{Lucas numbers} are a slight variation of Fibonacci numbers. 
These numbers follow the same recursion:
$$l_{n+1}=l_n + l_{n-1}$$
but having different initial conditions: $l_1=1, l_2=3$ leading to the sequence
$1, 3, 4, 7, 11, 18, 29, 47, 76, 123,\ldots$.

Lucas numbers have the following property: $l_n=f_{n-1}+f_{n+1}$ where $f_n$ is the $n^{th}$ Fibonacci number.</content>
</record>
