Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #15 May 19 2020 19:13:33
%S 0,0,1,1,1,1,1,2,1,2,1,2,1,2,1,2,1,2,1,2,2,2,1,3,1,2,2,2,1,3,1,2,2,2,
%T 1,3,1,2,2,2,1,3,1,2,2,2,1,3,1,2,2,2,1,3,1,3,2,2,1,4,1,2,2,3,1,3,1,3,
%U 2,2,1,4,1,2,2,3,1,3,1,3,2,2,1,4,1,2,2,3,1,3,1,3,2,2,1,4,1,2,2,3,1,3,1,3,2
%N Number of divisors of n that are < log(n).
%H Antti Karttunen, <a href="/A095999/b095999.txt">Table of n, a(n) for n = 1..65537</a>
%t f[n_] := Length[ Select[ Divisors[ n], # < Log[ n] &]]; Table[ f[n], {n, 105}]
%o (PARI) a(n) = sumdiv(n, d, d<log(n)); \\ _Michel Marcus_, Jun 29 2015
%o (PARI) A095999(n) = sumdiv(n, d, exp(d)<n); \\ _Antti Karttunen_, May 19 2020
%K nonn
%O 1,8
%A _Robert G. Wilson v_, Jul 19 2004, based on a suggestion from _Leroy Quet_, Jun 18 2004