|
%I #6 Mar 30 2012 18:39:09
%S 1,2,3,4,3,5,4,2,6,4,5,2,4,7,3,5,6,2,4,2,5,8,3,2,6,5,7,4,3,2,5,2,6,4,
%T 9,5,4,2,3,7,6,2,8,2,3,5,3,2,6,2,5,4,7,2,4,10,6,4,3,2,5,2,3,8,6,7,4,2,
%U 9,4,5,2,6,2,3,5,3,2,7,2,6,4,3,2,8,5,3,4,6,11,5,7,3,4,3,5,6,2,3,4,5,2,4
%N Greatest k such that f(k,1) divides f(k,n) where f(k,n) is the k-th term of the sequence : f(1,n)=1 f(2,n)= n f(k+2,n)=f(k+1,n)+f(k,n) (f(k,1) is the Fibonacci sequence).
%F It seems that sum(i=1, n, a(i) ) is asymptotic to C*n where 4 < C < 9/2
%K nonn
%O 1,2
%A _Benoit Cloitre_, Oct 15 2002
|
