%N For n>0, let b(n) = greatest index of n in any Fibonacci-like sequence containing n. This sequence is the ordinal transform of b.
%C A Fibonacci-like sequence f satisfies f(n+2) = f(n+1) + f(n), and is uniquely identified by its two initial terms f(0) and f(1).
%C For any n>0, b(n) >= 2 (as n appears at index 2 in the Fibonacci-like sequence with initial terms n and 0).
%C Conjecturally, for any n>1, b(n) = A199088(n).
%C a(A000045(n)) = 1 for any n>0.
%C The ordinal transform mentioned is the one described in A002260: the ordinal transform of a sequence b(n) is the sequence t(n) = number of values in b(1),...,b(n) which are equal to b(n).
%H Rémy Sigrist, <a href="/A286343/b286343.txt">Table of n, a(n) for n = 1..10000</a>
%H Rémy Sigrist, <a href="/A286343/a286343.txt">C program for A286343</a>
%Y Cf. A000045, A199088.
%A _Rémy Sigrist_, May 07 2017