login

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”).

A095999
Number of divisors of n that are < log(n).
1
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, 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, 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
OFFSET
1,8
LINKS
MATHEMATICA
f[n_] := Length[ Select[ Divisors[ n], # < Log[ n] &]]; Table[ f[n], {n, 105}]
PROG
(PARI) a(n) = sumdiv(n, d, d<log(n)); \\ Michel Marcus, Jun 29 2015
(PARI) A095999(n) = sumdiv(n, d, exp(d)<n); \\ Antti Karttunen, May 19 2020
CROSSREFS
Sequence in context: A160984 A346094 A082898 * A334948 A161238 A161062
KEYWORD
nonn
AUTHOR
Robert G. Wilson v, Jul 19 2004, based on a suggestion from Leroy Quet, Jun 18 2004
STATUS
approved