This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A286343 #16 Jun 14 2017 02:46:59 %S A286343 1,1,1,2,1,2,3,1,3,2,4,5,1,6,3,2,7,4,8,5,1,9,6,3,7,2,10,8,4,9,10,5,11, %T A286343 1,12,13,6,14,3,7,15,2,16,17,8,18,4,9,19,10,20,5,11,21,1,12,22,13,23, %U A286343 6,14,24,3,15,7,16,25,2,17,26,18,19,8,20,27,4,21 %N A286343 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 A286343 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 A286343 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 A286343 Conjecturally, for any n>1, b(n) = A199088(n). %C A286343 a(A000045(n)) = 1 for any n>0. %C A286343 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 A286343 Rémy Sigrist, <a href="/A286343/b286343.txt">Table of n, a(n) for n = 1..10000</a> %H A286343 Rémy Sigrist, <a href="/A286343/a286343.txt">C program for A286343</a> %Y A286343 Cf. A000045, A199088. %K A286343 nonn,look %O A286343 1,4 %A A286343 _Rémy Sigrist_, May 07 2017