cp's OEIS Frontend

A072546 Sequence related to Fibonacci and "tribonacci" sequences : let f(1)=1, f(2)=n, f(k+2)=f(k+1)+f(k), t(1)=t(2)=t(3)=1, t(k+3)=t(k+2)+t(k+1)+t(k) (t(k)=A000213(k-1)); sequence gives the smallest value k = a(n) such that t(k)>f(k).

%I A072546 #8 Jan 01 2024 13:53:55
%S A072546 6,9,12,14,15,16,18,19,19,20,21,21,22,23,23,24,24,25,25,25,26,26,26,
%T A072546 27,27,27,28,28,28,28,29,29,29,29,30,30,30,30,30,31,31,31,31,31,32,32,
%U A072546 32,32,32,32,32,33,33,33,33,33,33,33,34,34,34,34,34,34,34,34,35,35,35,35
%N A072546 Sequence related to Fibonacci and "tribonacci" sequences : let f(1)=1, f(2)=n, f(k+2)=f(k+1)+f(k), t(1)=t(2)=t(3)=1, t(k+3)=t(k+2)+t(k+1)+t(k) (t(k)=A000213(k-1)); sequence gives the smallest value k = a(n) such that t(k)>f(k).
%F A072546 Asymptotically: a(n)= C*Log(n) + 0(Log(n)) with C a constant = 8.2... (this constant doesn't depend on initial values f(1), t(1), t(2), t(3) while f(2)=n )
%Y A072546 Cf. A000045, A000213, A000204.
%K A072546 nonn
%O A072546 1,1
%A A072546 _Benoit Cloitre_, Aug 05 2002