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 A175495 #41 Jul 30 2021 06:19:32
%S A175495 1,2,3,4,6,8,10,12,14,15,16,18,20,24,28,30,32,36,40,42,44,45,48,50,52,
%T A175495 54,56,60,63,64,66,70,72,78,80,84,88,90,96,100,102,104,105,108,110,
%U A175495 112,114,120,126,128,130,132,135,136,138,140,144,150,152,154,156
%N A175495 Positive integers k such that k < 2^d(k), where d(k) is the number of divisors of k.
%C A175495 Numbers k for which A175494(k) = 1.
%C A175495 After the initial 1 in this sequence, the first integer in this sequence but not in A034884 is 44.
%C A175495 All 52 terms of A034884 are also in this sequence. - _Zak Seidov_, May 30 2010
%C A175495 All powers of 2 are terms. - _D. S. McNeil_, May 30 2010
%C A175495 It follows from the Wiman-Ramanujan theorem that, for every eps > 0 and k > k_0(eps), we have k > tau(k)^(log(log(k))/(log(2)+eps)). Therefore in particular A034884 is finite. On the other hand, for 0 < eps < log(2), it is known that there exist infinitely many numbers for which k < tau(k)^(log(log(k))/(log(2)-eps)), that is, tau(k) > k^((log(2)-eps)/log(log(k))) and 2^tau(k) > 2^(k^((log(2)-eps)/log(log(k)))) >> k. In particular, A175495 is infinite. - _Vladimir Shevelev_, May 30 2010
%D A175495 K. Prachar, Primzahlverteilung, Springer-Verlag, 1957, Ch. 1, Theorem 5.2.
%D A175495 S. Ramanujan, Highly composite numbers, Collected papers, Cambridge, 1927, 85-86.
%D A175495 A. Wiman, Sur l'ordre de grandeur du nombre de diviseurs d'un entier, Arkiv Mat. Astr. och Fys., 3, no. 18 (1907), 1-9.
%H A175495 T. D. Noe, <a href="/A175495/b175495.txt">Table of n, a(n) for n = 1..10000</a>
%t A175495 t = {}; n = 0; While[Length[t] < 100, n++; If[n < 2^DivisorSigma[0, n], AppendTo[t, n]]]; t (* _T. D. Noe_, May 14 2013 *)
%t A175495 Select[Range[200],#<2^DivisorSigma[0,#]&] (* _Harvey P. Dale_, Apr 24 2015 *)
%o A175495 (PARI) isok(n) = n < 2^numdiv(n); \\ _Michel Marcus_, Sep 09 2019
%o A175495 (Python)
%o A175495 from sympy import divisor_count
%o A175495 def ok(n): return n < 2**divisor_count(n)
%o A175495 print(list(filter(ok, range(1, 157)))) # _Michael S. Branicky_, Jul 29 2021
%Y A175495 Cf. A000005, A175494, A034884.
%K A175495 nonn
%O A175495 1,2
%A A175495 _Leroy Quet_, May 30 2010
%E A175495 More terms from _Jon E. Schoenfield_, Jun 13 2010