This site is supported by donations to The OEIS Foundation.
File:K m Fib.pdf
For the integers we define the k-step sum and m-step gap Fibonacci sequence, whose n -th term is given by the recurrence relation for every , with
This recurrence formula generates the 𝑛-th term of the sequence as the sum of 𝑘 successive previous terms starting the sum at the 𝑚-th previous term.
Reference : Adam M., Assimakis N., “k-step sum and m-step gap Fibonacci sequence”, ISRN Discrete Mathematics, vol. 2014, Article ID 374902, 7 pages, http://dx.doi.org/10.1155/2014/374902, 2014.
Demo Link : http://elnsite.teilam.gr/kmfib/
File history
Click on a date/time to view the file as it appeared at that time.
Date/Time | Dimensions | User | Comment | |
---|---|---|---|---|
current | 06:44, 17 December 2015 | (118 KB) | Maria Adam (talk | contribs) | For the integers <math>k=1,2, \ldots, </math> <math>m=0,1,2, \ldots, </math> we define the ''k''-step sum and ''m''-step gap Fibonacci sequence, whose'' n'' -th term is given by the recurrence relation <math>f_{n} = f_{n-m-1}+f_{n-m-2}+ \cdots + f_{n-m-k |
05:33, 17 December 2015 | (138 KB) | Maria Adam (talk | contribs) | Adam M., Assimakis N., “k-step sum and m-step gap Fibonacci sequence”, ISRN Discrete Mathematics, vol. 2014, Article ID 374902, 7 pages, http://dx.doi.org/10.1155/2014/374902, 2014. http://elnsite.teilam.gr/kmfib/ |
- You cannot overwrite this file.
File usage
The following file is a duplicate of this file (more details):
There are no pages that link to this file.