k阶斐波那契数列的前k-2项都是0,第k-1项为1,然后后面每一项都是它前面的k项之和
function fibonacciIterative(k,m){
if(k<1)return false;
if(m<k-1)return 0;
if(m==k-1)return 1;
return fibonacciIterative(k,m-1)+fibonacciIterative(k,m-2);
}
console.log(fibonacciIterative(3,8))
//13