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 A071677 #19 Apr 19 2025 03:58:53
%S A071677 1,3,8,9,14,15,22,44,45,52,63,64,105,110,130,152,154,165,174,184,189,
%T A071677 190,195,196,208,225,230,232,256,272,310,405,442,464,496,512,567,592,
%U A071677 656,688,820,884,891,940,976,1036,1068,1125,1148,1210,1215,1284,1305
%N A071677 Numbers k such that the number of divisors of k equals the maximum number of elements among the continued fractions for k/1, k/2, k/3, k/4, ..., k/k.
%C A071677 Numbers k such that A000005(k) = A071647(k). - _Amiram Eldar_, Apr 19 2025
%H A071677 Amiram Eldar, <a href="/A071677/b071677.txt">Table of n, a(n) for n = 1..1000</a>
%t A071677 q[k_] := DivisorSigma[0, k] == Max[Table[Length[ContinuedFraction[k/i]], {i, 1, k}]]; Select[Range[1500], q] (* _Amiram Eldar_, Apr 19 2025 *)
%o A071677 (PARI) for(n=1,1000, if( numdiv(n) == vecmax( vector(n,i,length(contfrac(n/i)))), print1(n,",")));
%Y A071677 Cf. A000005, A071647.
%K A071677 nonn
%O A071677 1,2
%A A071677 _Benoit Cloitre_, Jun 22 2002