LucasL
The nth Lucas number: the Fibonacci-style recurrence started from , , closely related to Fibonacci.
✓ checked against that system · ! checked, with disagreements (hover a chip)Wikipedia
Lucas numberMathWorldLucasNumberWikidataQ2503280OEISA000032Wolfram LanguageLucasL✓LucasL(n)the nth Lucas number .LucasL(nu)a real (non-integer) index via Binet's formula, .LucasL(n, x)the Lucas polynomial , from with , , exact for a nonnegative integer n.Typed signatures
| Type | Package | Applies |
|---|---|---|
(integer) -> integer | compute-engine | always |
(number, any?) -> any | number-theoryreplaces compute-engine | always |
(value) -> value | adelesreplaces number-theory | on ProfiniteNumber |
Details
- Defined by the same recurrence as Fibonacci, , but started from , .
- Closed form: , where and .
- Related to Fibonacci by and, conversely, .
- Consecutive ratios converge to the golden ratio, just as they do for Fibonacci.
- Extends to negative n via .
- A list of indices is threaded over element-wise; a real (non-integer) index evaluates numerically via Binet's formula, and a symbolic second argument gives the Lucas polynomial.
Examples
Scope #
Applications #
Properties #
Each term is the sum of the previous two
live ↗InOut
Known value · Wolfram MathematicalFunctionData, LucasL
Lucas numbers grow by about the golden ratio each step
live ↗InOut
Known value · Wolfram MathematicalFunctionData, LucasL
About
| Examples | 41 |
|---|---|
| Checked against | Wolfram Language 41 agreeSageMath 23 agree6 errorSymPy 25 agree1 differ3 unevaluatedmpmath 27 agreeJulia 21 agree6 error |
| Crosswalk | WikipediaMathWorldWikidataOEISWolfram LanguageSageMathSymPyJulia |
Implementation
mapped
wolframpackages/oracle/src/mappings.tsmapped
sympypackages/oracle/src/mappings.tsmapped
sagepackages/oracle/src/mappings.tsmapped
juliapackages/oracle/src/mappings.tsmapped
mpmathpackages/oracle/src/mappings.tsF(n − 1) + F(n + 1): Lucas' number for integer n and its continuation otherwise.
See also: Fibonacci