Define a Fibonacci-type sequence to be one of the form s(1) = s_1 >= 1, s(2) = 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.
A088527
Define a Fibonacci-type sequence to be one of the form s(1) = s_1 >= 1, s(2) = 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) =2a(1) =3a(2) =4a(3) =4a(4) =5a(5) =4a(6) =5a(7) =6a(8) =5a(9) =5a(10) =6a(11) =5a(12) =7a(13) =6a(14) =5a(15) =6a(16) =6a(17) =7a(18) =6a(19) =6a(20) =8a(21) =6a(22) =7a(23) =6a(24) =6a(25) =7a(26) =6a(27) =7a(28) =8a(29) =6
External references
- oeis: A088527