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 A067283 #13 Jul 21 2019 12:26:28 %S A067283 11,13,17,19,25,49,55,57,58,62,65,69,74,77,82,85,86,87,91,93,94,95, %T A067283 106,111,115,118,119,122,123,125,129,133,134,141,142,143,145,146,404, %U A067283 412,423,425,428,436,452,475,477,507,508,524,531,539,548,549,556,575,578 %N A067283 Numbers n such that the number of divisors of n is floor(log(n)). %H A067283 Amiram Eldar, <a href="/A067283/b067283.txt">Table of n, a(n) for n = 1..10000</a> %F A067283 n such that A000005(n) = A000195(n). %t A067283 Select[Range[600],DivisorSigma[0,#]==Floor[Log[#]]&] (* _Harvey P. Dale_, May 07 2018 *) %Y A067283 Cf. A000005, A000195. %K A067283 nonn %O A067283 1,1 %A A067283 _Benoit Cloitre_, Feb 24 2002