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

A096001
Least number k such that the number of divisors of k which are < log(k) equals n.
0
1, 3, 8, 24, 60, 180, 420, 1260, 3360, 10080, 22680, 83160, 166320, 720720, 1441440, 3603600, 9369360, 24504480, 73513440, 232792560, 698377680, 1396755360, 3724680960, 10708457760, 26771144400, 80313433200, 214169155200, 562194032400, 1525955230800
OFFSET
0,2
COMMENTS
Reminiscent of highly composite numbers.
MATHEMATICA
f[n_] := Length[ Select[ Divisors[ n], # < Log[ n] &]]; g[n_] := g[n] = Block[{k = 2g[n - 1]}, While[f[k] != n, k++ ]; k]; g[0] = 1; Table[ g[n], {n, 20}]
CROSSREFS
Sequence in context: A084920 A323278 A026556 * A080097 A096886 A176904
KEYWORD
nonn
AUTHOR
Robert G. Wilson v, Jul 19 2004, based on a suggestion from Leroy Quet, Jun 18 2004
EXTENSIONS
a(21)-a(28) from Donovan Johnson, Oct 04 2012
STATUS
approved