Let F(k,n) = k*F(k,n-1) + F(k,n-2) with initial conditions F(k,0) = 0, F(k,1) = 1. Sequence lists the minimum 'n' such that F(k,n) > k^n.

A282756

Let F(k,n) = k*F(k,n-1) + F(k,n-2) with initial conditions F(k,0) = 0, F(k,1) = 1. Sequence lists the minimum 'n' such that F(k,n) > k^n.

Terms

    a(0) =3a(1) =6a(2) =14a(3) =27a(4) =45a(5) =70a(6) =101a(7) =139a(8) =184a(9) =236a(10) =296a(11) =364a(12) =440a(13) =524a(14) =616a(15) =716a(16) =826a(17) =943a(18) =1070a(19) =1205a(20) =1350a(21) =1503a(22) =1666a(23) =1838a(24) =2019a(25) =2210a(26) =2410a(27) =2620a(28) =2839a(29) =3069

External references