Content deleted Content added
Tag: Reverted |
Undid WP:GOODFAITH revision 1298868925 by Mathician~enwiki (talk) Let's stick with the status quo here for now. We'll revisit this edit if codenominator function survives its request for deletion |
||
Line 652:
Some specific examples that are close, in some sense, to the Fibonacci sequence include:
* Generalizing the index to negative integers to produce the [[negafibonacci]] numbers.
* Generalizing the index to [[real number]]s using a modification of Binet's formula.<ref name="MathWorld" />
* Starting with other integers. [[Lucas number]]s have {{math|1=''L''<sub>1</sub> = 1}}, {{math|1=''L''<sub>2</sub> = 3}}, and {{math|1=''L<sub>n</sub>'' = ''L''<sub>''n''−1</sub> + ''L''<sub>''n''−2</sub>}}. [[Primefree sequence]]s use the Fibonacci recursion with other starting points to generate sequences in which all numbers are composite.
| |||