Anonymous user
Talk:Fibonacci n-step number sequences: Difference between revisions
Talk:Fibonacci n-step number sequences (view source)
Revision as of 03:21, 26 May 2012
, 11 years ago→Base case 0: I've seen it too, but we can handle it.
(→task clarification: Answered.) |
(→Base case 0: I've seen it too, but we can handle it.) |
||
Line 45:
Looking at the other sequences here, the 0 also works. For n = 3, [0, 1, 1] produces the same sequence (with the additional 0 at the beginning). For n = 4, [0, 1, 1, 2] produces the same sequence, and so on. --[[User:Spoon!|Spoon!]] 01:38, 26 May 2012 (UTC)
:This [http://www.math-cs.ucmo.edu/~curtisc/articles/howardcooper/genfib4.pdf reference, (pdf)] gives the zero too but I had found the was I reported earlier and just stuck with it. If you were to just make a note of the change in 'base' at the head of any example using this alternative then it should not be a problem. --[[User:Paddy3118|Paddy3118]] 03:21, 26 May 2012 (UTC)
| |||