Define a Fibonacci-type sequence to be one of the form s(0) = s_1 >= 1, s(1) = s_2 >= 1, s(n+2) = s(n+1) + s(n); then a(n) = maximal m such that n is the m-th term in some Fibonacci-type sequence.
A088858
Define a Fibonacci-type sequence to be one of the form s(0) = s_1 >= 1, s(1) = s_2 >= 1, s(n+2) = s(n+1) + s(n); then a(n) = maximal m such that n is the m-th term in some Fibonacci-type sequence.
Terms
- a(0) =1a(1) =2a(2) =3a(3) =3a(4) =4a(5) =3a(6) =4a(7) =5a(8) =4a(9) =4a(10) =5a(11) =4a(12) =6a(13) =5a(14) =4a(15) =5a(16) =5a(17) =6a(18) =5a(19) =5a(20) =7a(21) =5a(22) =6a(23) =5a(24) =5a(25) =6a(26) =5a(27) =6a(28) =7a(29) =5
External references
- oeis: A088858