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 A122700 #20 Jun 26 2022 05:53:06
%S A122700 2,3,4,5,8,12,13,15,21,30,34,39,40,42,48,55,56,65,72,74,80,89,102,110,
%T A122700 130,144,168,170,176,180,185,193,194,208,233,272,275,288,297,299,312,
%U A122700 336,340,377,400,445,456,468,517,546,550,610,638,699,715,720,754,777
%N A122700 Numbers k such that the length of the continued fraction for (k/m) is maximized for a unique m (1 < m < k).
%C A122700 Sequence contains all the Fibonacci numbers greater than 1 (A020695).
%H A122700 Amiram Eldar, <a href="/A122700/b122700.txt">Table of n, a(n) for n = 1..500</a>
%e A122700 5/2 = [2, 2], 5/3 = [1, 1, 2], 5/4 = [1, 4]; thus the continued fraction for 5/m is maximized at the unique value m=3, and 5 is in the sequence.
%t A122700 cfQ[v_] := Count[v, Max[v]] == 1; q[n_] := cfQ[Length[ContinuedFraction[#/n]] & /@ Range[2, n - 1]]; Join[{2}, Select[Range[3, 1000], q]](* _Amiram Eldar_, Jun 25 2022 *)
%Y A122700 Cf. A020695, A084242.
%Y A122700 Cf. A089642. - _R. J. Mathar_, Aug 02 2008
%K A122700 nonn
%O A122700 1,1
%A A122700 _Benoit Cloitre_, Oct 25 2006