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 A365485 #7 Sep 06 2023 14:58:28 %S A365485 1,7,39,298,2615,23438,225682,2229674,21903726 %N A365485 a(n) = A365399(10^n). %C A365485 a(n)/10^n appears to be decreasing. Conjecture: a(n)/10^n converges to a nonzero value. %o A365485 (Python) %o A365485 from bisect import bisect %o A365485 from sympy import divisor_count %o A365485 def A365485(n): %o A365485 m = 10**n %o A365485 plist, qlist, c = tuple(divisor_count(i) for i in range(1,m+1)), [0]*(m+1), 0 %o A365485 for i in range(m): %o A365485 qlist[a:=bisect(qlist,plist[i],lo=1,hi=c+1,key=lambda x:plist[x])]=i %o A365485 c = max(c,a) %o A365485 return c %Y A365485 Cf. A000005, A365399. %K A365485 nonn,hard,more %O A365485 0,2 %A A365485 _Chai Wah Wu_, Sep 05 2023