Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #23 Apr 07 2020 22:30:26
%S 2,2,4,5,4,6,5,4,7,5,6,5,5,8,5,6,7,5,6,5,6,9,5,6,7,6,8,5,6,7,6,6,7,6,
%T 10,6,6,7,6,8,7,6,9,6,6,7,6,8,7,6,7,6,8,7,6,11,7,6,7,6,8,7,6,9,7,8,7,
%U 6,10,7,6,7,7,8,7,6,9,7,8,7,7,8,7,6,9
%N Excluding the two leftmost columns - the seeds - in the monotonic justified array of all positive Fibonacci sequences (A160271), the lowest column index which contains n in the smallest row which contains n (A199087).
%C Northwest corner of A160271, including the Fibonacci-type sequence containing only 0's as the 0th row:
%C 0....0....0....0....0....0....0....0....0....0
%C 1....0....1....1....2....3....5....8...13...21
%C 2....0....2....2....4....6...10...16...26...42
%C 3....0....3....3....6....9...15...24...39...63
%C 2....1....3....4....7...11...18...29...47...76
%C 4....0....4....4....8...12...20...32...52...84
%C 3....1....4....5....9...14...23...37...60...97
%C 5....0....5....5...10...15...25...40...65..105
%C 4....1....5....6...11...17...28...45...73..118
%C 3....2....5....7...12...19...31...50...81..131
%H Clark Kimberling, <a href="https://doi.org/10.1007/978-94-011-2058-6_39">Orderings of the set of all positive Fibonacci sequences</a>, in G. E. Bergum et al., editors, Applications of Fibonacci Numbers, Vol. 5 (1993), pp. 405-416.
%Y Cf. A199087, A160271, A035614.
%K nonn
%O 0,1
%A _Casey Mongoven_, Nov 06 2011