Anonymous user
Talk:Fibonacci sequence: Difference between revisions
→Optional credits: changed the lists to tables. -- ~~~~
(→Optional credits: added a couple of comments on optional credits. -- ~~~~) |
(→Optional credits: changed the lists to tables. -- ~~~~) |
||
Line 60:
I would've like to see an optional credit solution for allowing the specification of the starting (two) numbers.
<br>This would've allowed the examples to also generate the Lucas numbers.
{| style="text-align: left; width: 20%;" border="4" cellpadding="2" cellspacing="2"
Another possibility would allow the specifiction of how many (previous) numbers to be summed.▼
|- style="background-color: rgb(255, 204, 255);"
|-
| Fibonacci || 0, 1
|-
| Lucas || 2, 1
|}
▲<br> Another possibility would allow the specifiction of how many (previous) numbers to be summed.
{| style="text-align: left; width: 20%;" border="4" cellpadding="2" cellspacing="2"
|+ Fibonacci sequences [sum of N numbers]
|- style="background-color: rgb(255, 204, 255);"
! series name !! number of values to add
|-
| Fibonacci || 2
|-
| tribonacci || 3
|-
| tetranacci || 4
|-
| pentanacci || 5
|-
| hexanacci || 6
|-
| heptanacci || 7
|-
| octanacci || 8
|-
| nonanacci || 9
|-
| dodecanacci || 10
|}
There may be more named Fibonacci numbers in this series of series. -- [[User:Gerard Schildberger|Gerard Schildberger]] 20:15, 24 May 2012 (UTC)
| |||