Let f(1)=f(2)=1, f(k)=f(k-1)+f(k-2)+ (k (mod n)). Then f(k)=floor(r(n)*F(k))+g(k) where F(k) denotes the k-th Fibonacci number and g(k) a function becoming periodic. Sequence depends on r(n) which is the largest positive root of : a(3n-2)*X^2-a(3n-1)*X+a(3n)=0.
A081420
Let f(1)=f(2)=1, f(k)=f(k-1)+f(k-2)+ (k (mod n)). Then f(k)=floor(r(n)*F(k))+g(k) where F(k) denotes the k-th Fibonacci number and g(k) a function becoming periodic. Sequence depends on r(n) which is the largest positive root of : a(3n-2)*X^2-a(3n-1)*X+a(3n)=0.
Terms
- a(0) =0a(1) =1a(2) =1a(3) =1a(4) =1a(5) =1a(6) =4a(7) =18a(8) =19a(9) =5a(10) =25a(11) =31a(12) =11a(13) =64a(14) =89a(15) =4a(16) =24a(17) =31a(18) =29a(19) =184a(20) =236a(21) =45a(22) =285a(23) =319a(24) =76a(25) =486a(26) =499a(27) =121a(28) =759a(29) =639
External references
- oeis: A081420